5595 search results - page 80 / 1119 » Approximation Algorithms for Clustering Problems |
158
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
153
click to vote
ESA
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
165
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
134
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
173
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...