630 search results - page 10 / 126 » Hardness results for approximating the bandwidth |
139
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
274
click to vote
COCO
2011
Springer
14 years 5 months ago
2011
Springer
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
185
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
177
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
142
click to vote
SAGT
2009
Springer
16 years 18 days ago
2009
Springer
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...