572 search results - page 6 / 115 » Exponential-Time Approximation of Hard Problems |
LMCS
2007
15 years 9 days ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
COCO
2006
Springer
15 years 4 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...
90
Voted
CORR
2004
Springer
15 years 9 days ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
92
Voted
STOC
2005
ACM
16 years 23 days ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
103
click to vote
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...