scholarly journals How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems

2005 ◽  
Author(s):  
K. Dhamdhere ◽  
V. Goyal ◽  
R. Ravi ◽  
M. Singh
Keyword(s):  
Approximation Algorithms ◽  
Covering Problems

On-line and off-line approximation algorithms for vector covering problems

1996 ◽  
pp. 406-418 ◽  
Author(s):  
Noga Alon ◽  
János Csirik ◽  
Sergey V. Sevastianov ◽  
Arjen P. A. Vestjens ◽  
Gerhard J. Woeginger
Keyword(s):  
Approximation Algorithms ◽  
Covering Problems ◽  
On Line

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

Algorithmica ◽  
1998 ◽  
Vol 21 (1) ◽  
pp. 104-118 ◽  
Author(s):  
N. Alon ◽  
Y. Azar ◽  
J. Csirik ◽  
L. Epstein ◽  
S. V. Sevastianov ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Covering Problems ◽  
On Line

scholarly journals Improved approximation algorithms for minimum power covering problems

2019 ◽  
Vol 795 ◽  
pp. 285-300
Author(s):  
Gruia Calinescu ◽  
Guy Kortsarz ◽  
Zeev Nutov
Keyword(s):  
Approximation Algorithms ◽  
Covering Problems ◽  
Minimum Power

Approximation algorithms for geometric conflict free covering problems

2020 ◽  
Vol 89 ◽  
pp. 101591
Author(s):  
Aritra Banik ◽  
Vibha Sahlot ◽  
Saket Saurabh
Keyword(s):  
Approximation Algorithms ◽  
Covering Problems
Sign in / Sign up

Export Citation Format

Share Document