369 search results - page 18 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
173
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
169
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
160
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
165
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
158
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...