296 search results - page 49 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
106
click to vote
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
122
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
123
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...