Results 1  10
of
2,327,837
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 252 (12 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 algorithm for the TSP with neighborhoods in the plane
"... 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 TSPN on an arbitrary set of disjoint, connected neigh ..."
Abstract

Cited by 61 (5 self)
 Add to MetaCart
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 TSPN on an arbitrary set of disjoint, connected
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 32 (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
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 100 (10 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 MulticommodityRentorBuy Problem
"... Abstract We present the first constantfactor approximation algorithm for network design with multiple commodities and economiesof scale. We consider the rentorbuy problem, a type of multicommodity buyatbulk network design in which there are two ways to install capacity on any given edge. Capaci ..."
Abstract
 Add to MetaCart
Abstract We present the first constantfactor approximation algorithm for network design with multiple commodities and economiesof scale. We consider the rentorbuy problem, a type of multicommodity buyatbulk network design in which there are two ways to install capacity on any given edge
www.theoryofcomputing.org A ConstantFactor Approximation Algorithm for Coclustering ∗
, 2011
"... Abstract: Coclustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by several applications in text mining, marketbasket analysis, and bioinformatics, this problem has attracted a lot of ..."
Abstract
 Add to MetaCart
of attention in the past few years. Unfortunately, to date, most of the algorithmic work on this problem has been heuristic in nature. In this work we obtain the first approximation algorithms for the coclustering problem. Our algorithms are simple and provide constantfactor approximations to the optimum. We
Asymptotic constantfactor approximation algorithm for the Traveling Salesperson Problem for Dubins’ vehicle
, 2006
"... This article proposes the first known algorithm that achieves a constantfactor approximation of the minimum length tour for a Dubins’ vehicle through n points on the plane. By Dubins’ vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without revers ..."
Abstract
 Add to MetaCart
This article proposes the first known algorithm that achieves a constantfactor approximation of the minimum length tour for a Dubins’ vehicle through n points on the plane. By Dubins’ vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without
A constantfactor approximation algorithm for the link building problem
 Proceedings of the 4th international conference on Combinatorial optimization and applications, Volume Part II
, 2010
"... Abstract. In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approxima ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
approximation schemes unless P = NP. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naive algorithm where we choose backlinks from nodes with high PageRank values compared to the outdegree and show that the naive algorithm
A constantfactor approximation algorithm for packet routing, and balancing local vs. global criteria
 In Proceedings of the ACM Symposium on the Theory of Computing (STOC
, 1997
"... Abstract. We present the first constantfactor approximation algorithm for a fundamental problem: the storeandforward packet routing problem on arbitrary networks. Furthermore, the queue sizes required at the edges are bounded by an absolute constant. Thus, this algorithmbalances a global criterio ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
Abstract. We present the first constantfactor approximation algorithm for a fundamental problem: the storeandforward packet routing problem on arbitrary networks. Furthermore, the queue sizes required at the edges are bounded by an absolute constant. Thus, this algorithmbalances a global
Results 1  10
of
2,327,837