5595 search results - page 32 / 1119 » Approximation Algorithms for Clustering Problems |
147
click to vote
MOR
2000
15 years 2 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
130
Voted
WINET
2010
15 years 26 days ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
109
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
140
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
130
click to vote
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
15 years 9 months ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...