207 search results - page 21 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
104
Voted
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
104
click to vote
ADHOCNETS
2009
Springer
15 years 6 months ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
131
click to vote
ESA
2003
Springer
15 years 5 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...