74 search results - page 9 / 15 » Approximating the Degree-Bounded Minimum Diameter Spanning T... |
101
click to vote
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
98
Voted
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. 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 stu...
80
Voted
IPL
1998
14 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
105
Voted
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...
85
Voted
MONET
2006
14 years 9 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...