630 search results - page 9 / 126 » Hardness results for approximating the bandwidth |
68
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
86
Voted
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...