Improved approximation algorithms for minimum power covering problems

Theoretical Computer Science ◽

10.1016/j.tcs.2019.07.010 ◽

2019 ◽

Vol 795 ◽

pp. 285-300

Author(s):

Gruia Calinescu ◽

Guy Kortsarz ◽

Zeev Nutov

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Download Full-text

Improved Approximation Algorithms for Minimum Power Covering Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-04693-4_9 ◽

2018 ◽

pp. 134-148 ◽

Author(s):

Gruia Calinescu ◽

Guy Kortsarz ◽

Zeev Nutov

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Download Full-text

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-31833-0_2 ◽

2005 ◽

pp. 6-8

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Approximation algorithms for partial covering problems*1

Journal of Algorithms ◽

10.1016/s0196-6774(04)00068-9 ◽

2004 ◽

Author(s):

R GANDHI

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Partial Covering

Download Full-text

From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems

Operations Research ◽

10.1287/opre.46.4.503 ◽

1998 ◽

Vol 46 (4) ◽

pp. 503-514 ◽

Author(s):

Dimitris Bertsimas ◽

Chung-Piaw Teo

Keyword(s):

Approximation Algorithms ◽

Valid Inequalities ◽

Covering Problems ◽

Primal Dual ◽

Download Full-text

Approximation algorithms for integer covering problems via greedy column generation

RAIRO - Operations Research ◽

10.1051/ro/1994280302831 ◽

1994 ◽

Vol 28 (3) ◽

pp. 283-302 ◽

Author(s):

Y. Crama ◽

J. Van De Klundert

Keyword(s):

Approximation Algorithms ◽

Column Generation ◽

Covering Problems

Download Full-text

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

46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) ◽

10.1109/sfcs.2005.42 ◽

2005 ◽

Author(s):

K. Dhamdhere ◽

V. Goyal ◽

R. Ravi ◽

M. Singh

Keyword(s):

Approximation Algorithms ◽

Covering Problems

Download Full-text

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

IFIP International Federation for Information Processing - Exploring New Frontiers of Theoretical Informatics ◽

10.1007/1-4020-8141-3_19 ◽

2006 ◽

pp. 223-236 ◽

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/11940128_57 ◽

2006 ◽

pp. 567-577 ◽

Author(s):

Mingen Lin ◽

Yang Yang ◽

Jinhui Xu

Keyword(s):

Approximation Algorithms ◽

Bin Packing ◽

Covering Problems ◽

Bin Covering ◽

Maximum Resource Bin Packing

Download Full-text

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

Algorithms — ESA '96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61680-2_71 ◽

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 ◽

Download Full-text

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

Algorithmica ◽

10.1007/pl00009203 ◽

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 ◽

Download Full-text