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 ◽

Cited By ~ 2

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

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

Fast approximation algorithms for fractional packing and covering problems

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185411 ◽

2002 ◽

Cited By ~ 39

Author(s):

S.A. Plotkin ◽

D.B. Shmoys ◽

E. Tardos

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Mathematics of Operations Research ◽

10.1287/moor.20.2.257 ◽

1995 ◽

Vol 20 (2) ◽

pp. 257-301 ◽

Cited By ~ 236

Author(s):

Serge A. Plotkin ◽

David B. Shmoys ◽

Éva Tardos

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Faster and simpler approximation algorithms for mixed packing and covering problems

Theoretical Computer Science ◽

10.1016/j.tcs.2007.02.064 ◽

2007 ◽

Vol 377 (1-3) ◽

pp. 181-204 ◽

Cited By ~ 3

Author(s):

Florian Diedrich ◽

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Bin Packing and Covering Problems with Rejection

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/11533719_89 ◽

2005 ◽

pp. 885-894

Author(s):

Yong He ◽

György Dósa

Keyword(s):

Bin Packing ◽

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

Structural Packing and Covering Problems

Research Problems in Discrete Geometry ◽

10.1007/0-387-29929-7_3 ◽

2006 ◽

pp. 75-120

Keyword(s):

Covering Problems ◽

Packing And Covering

Download Full-text

Fast LP-based Approximations for Geometric Packing and Covering Problems

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.62 ◽

2020 ◽

pp. 1019-1038

Author(s):

Chandra Chekuri ◽

Sariel Har-Peled ◽

Kent Quanrud

Keyword(s):

Covering Problems ◽

Packing And Covering ◽

Geometric Packing

Download Full-text

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Algorithmica ◽

10.1007/s00453-019-00670-w ◽

2020 ◽

Vol 82 (6) ◽

pp. 1703-1739

Author(s):

Michał Pilipczuk ◽

Erik Jan van Leeuwen ◽

Andreas Wiese

Keyword(s):

Polynomial Time ◽

Planar Graphs ◽

Approximation Schemes ◽

Covering Problems ◽

Packing And Covering ◽

Time Approximation ◽

Polynomial Time Approximation

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 ◽

Cited By ~ 29

Author(s):

Dimitris Bertsimas ◽

Chung-Piaw Teo

Keyword(s):

Approximation Algorithms ◽

Valid Inequalities ◽

Covering Problems ◽

Primal Dual ◽

Unified View

Download Full-text