104 search results - page 15 / 21 » On an Online Spanning Tree Problem in Randomly Weighted Grap... |
PVLDB
2010
14 years 8 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
180
click to vote
NLP
2000
15 years 1 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
SIAMDM
2010
14 years 8 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
105
click to vote
DISOPT
2010
14 years 9 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...