572 search results - page 26 / 115 » Exponential-Time Approximation of Hard Problems |
108
click to vote
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
WG
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
101
click to vote
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
COCO
2001
Springer
15 years 2 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...