Sciweavers

2698 search results - page 54 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
ICALP
2001
Springer
14 years 5 days ago
Approximation Algorithms for Partial Covering Problems
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...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
14 years 4 months ago
Approximation algorithm for the temperature-aware scheduling problem
— 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...
Sushu Zhang, Karam S. Chatha
TCBB
2008
73views more  TCBB 2008»
13 years 7 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
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...
Magnus Bordewich, Charles Semple
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Unbalanced Graph Cuts
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...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 9 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha