Results 1  10
of
2,822
ConstantFactor Approximation for TSP with Disks
, 2015
"... We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constantratio approximation for disks in the plane: Given a set of n disks in the plane, a TSP tour whose length is at most O(1) times the optimal with high probability can be computed in time that is polynomi ..."
Abstract
 Add to MetaCart
that is polynomial in n. Our result is the first constantratio approximation for a class of planar convex bodies of arbitrary size and arbitrary intersections. In order to achieve a O(1)approximation, we reduce the traveling salesman problem with disks, up to constant factors, to a minimum weight hitting set
A ConstantFactor Approximation for Stochastic Steiner Forest
 STOC'09
, 2009
"... We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would appear tomorrow; moreover, the cost of edges tomorrow will be λ times the cost of edges today. Which edges should we buy t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
problem has remained open, with previous works yielding constantfactor approximations only for special cases. We resolve the status of this problem by giving a constantfactor primaldual based approximation algorithm.
ConstantFactor Approximation Algorithms for Identifying Dynamic Communities
"... We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as “unusually densely knit ” subsets of a social network. This notion becomes more problematic if the social interactions change over time. Aggregating social net ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
. In this paper, we analyze its performance guarantee for a special case where all actors can be observed at all times. In such instances, we show that the algorithm is a small constant factor approximation of the optimum. We use a similar idea to design an approximation algorithm for the general case where some
A constantfactor approximation algorithm for the kmedian problem
 In Proceedings of the 31st Annual ACM Symposium on Theory of Computing
, 1999
"... We present the first constantfactor approximation algorithm for the metric kmedian problem. The kmedian problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are re ..."
Abstract

Cited by 249 (13 self)
 Add to MetaCart
We present the first constantfactor approximation algorithm for the metric kmedian problem. The kmedian problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster
A constantfactor approximation for multicovering with disks
 In Proceedings of the Symposium on Computational Geometry (SoCG
"... ABSTRACT We consider variants of the following multicovering problem with disks. We are given two point sets Y (servers) and X (clients) in the plane, and a coverage function κ : X → N . Centered at each server is a single disk whose radius we are free to set. The requirement is that each client x ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
x ∈ X be covered by at least κ(x) of the server disks. The objective function we wish to minimize is the sum of the areas of the disks. We present a polynomial time algorithm for this problem achieving an O(1) approximation.
A ConstantFactor Approximation Algorithm for the Multicommodity RentorBuy Problem
"... ... Recent work on buyatbulk network design has concentrated on the special case where all sinks are identical; existing constantfactor approximation algorithms for this special case make crucial use of the assumption that all commodities ship flow to the same sink vertex and do not obviously ext ..."
Abstract

Cited by 96 (8 self)
 Add to MetaCart
... Recent work on buyatbulk network design has concentrated on the special case where all sinks are identical; existing constantfactor approximation algorithms for this special case make crucial use of the assumption that all commodities ship flow to the same sink vertex and do not obviously
A constantfactor approximation algorithm for the k mst problem (extended abstract
 in Proceedings of the twentyeighth annual ACM symposium on Theory of computing (STOC ’96
, 1996
"... ABSTRACT In the Euclidean TSP with neighborhoods (TSPN) problem we seek a shortest tour that visits a given set of n neighborhoods. The Euclidean TSPN generalizes the standard TSP on points. We present the first constantfactor approximation algorithm for planar TSPN with pairwisedisjoint connecte ..."
Abstract

Cited by 58 (5 self)
 Add to MetaCart
ABSTRACT In the Euclidean TSP with neighborhoods (TSPN) problem we seek a shortest tour that visits a given set of n neighborhoods. The Euclidean TSPN generalizes the standard TSP on points. We present the first constantfactor approximation algorithm for planar TSPN with pairwise
A constantfactor approximation algorithm for optimal terrain guarding
 In Proc. ACMSIAM Symposium on Discrete Algorithms
, 2005
"... We present the first constantfactor approximation algorithm for a nontrivial instance of the optimal guarding (coverage) problem in polygons. In particular, we give an O(1)approximation algorithm for placing the fewest point guards on a 1.5D terrain, so that every point of the terrain is seen by ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
We present the first constantfactor approximation algorithm for a nontrivial instance of the optimal guarding (coverage) problem in polygons. In particular, we give an O(1)approximation algorithm for placing the fewest point guards on a 1.5D terrain, so that every point of the terrain is seen
Results 1  10
of
2,822