2698 search results - page 54 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
127
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
TCBB
2008
15 years 2 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
113
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
150
click to vote
IPCO
2004
15 years 3 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...