7129 search results - page 720 / 1426 » Approximation Algorithms for Treewidth |
236
Voted
FSTTCS
2003
Springer
16 years 11 days ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
219
click to vote
FOCS
2002
IEEE
16 years 3 days 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...
211
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
194
Voted
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
180
Voted
CP
2006
Springer
15 years 11 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...