Article

Algorithms for Polytope Covering and Approximation

Author:

Kenneth L. ClarksonAuthors Info & Claims

WADS '93: Proceedings of the Third Workshop on Algorithms and Data Structures

Pages 246 - 252

Published: 11 August 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Har-Peled SJones MCzumaj A(2018)On separating points by linesProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175329(918-932)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175329
Fekete SHuang KMitchell JParekh OPhillips C(2018)Geometric Hitting Set for Segments of Few OrientationsTheory of Computing Systems10.1007/s00224-016-9744-762:2(268-303)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00224-016-9744-7
Gerard Y(2017)About the Decidability of Polyhedral Separability in the Lattice $$\mathbb {Z}^d$$ZdJournal of Mathematical Imaging and Vision10.1007/s10851-017-0711-y59:1(52-68)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s10851-017-0711-y
Show More Cited By

Algorithms for Polytope Covering and Approximation

Recommendations

Facets and lifting procedures for the set covering polytope

Given a family of subsetsź of an arbitrary groundsetE, acover ofź is any setC źE having non-empty intersection with every subset inź.
In this paper we deal with thecovering polytope, i.e., the convex hull of the incidence vectors of all the covers ofź. ...
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}

While the set packing polytope, through its connection with vertex packing, has lent itself to fruitful investigations, little is known about the set covering polytope. We characterize the class of valid inequalities for the set covering polytope with ...
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}

In an earlier paper (Mathematical Programming 43 (1989) 57---69) we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or 2. In this paper we connect that characterization to the theory ...

Comments

Information & Contributors

Information

Published In

WADS '93: Proceedings of the Third Workshop on Algorithms and Data Structures

August 1993

631 pages

ISBN:3540571558

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 August 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Har-Peled SJones MCzumaj A(2018)On separating points by linesProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175329(918-932)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175329
Fekete SHuang KMitchell JParekh OPhillips C(2018)Geometric Hitting Set for Segments of Few OrientationsTheory of Computing Systems10.1007/s00224-016-9744-762:2(268-303)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00224-016-9744-7
Gerard Y(2017)About the Decidability of Polyhedral Separability in the Lattice $$\mathbb {Z}^d$$ZdJournal of Mathematical Imaging and Vision10.1007/s10851-017-0711-y59:1(52-68)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s10851-017-0711-y
Arya SFonseca GMount D(2017)On the Combinatorial Complexity of Approximating PolytopesDiscrete & Computational Geometry10.1007/s00454-016-9856-558:4(849-870)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s00454-016-9856-5
Blum AHar-Peled SRaichel B(2016)Sparse approximation via generating point setsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884475(548-557)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884475
Abraham IDelling DFiat AGoldberg AWerneck R(2016)Highway Dimension and Provably Efficient Shortest Path AlgorithmsJournal of the ACM10.1145/298547363:5(1-26)Online publication date: 8-Dec-2016
https://dl.acm.org/doi/10.1145/2985473
Bandyapadhyay SBhowmick SVaradarajan KIndyk P(2015)Approximation schemes for partitioningProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722225(1457-1470)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722225
Agarwal PPan JCheng SDevillers O(2014)Near-Linear Algorithms for Geometric Hitting Sets and Set CoversProceedings of the thirtieth annual symposium on Computational geometry10.1145/2582112.2582152(271-279)Online publication date: 8-Jun-2014
https://dl.acm.org/doi/10.1145/2582112.2582152
Agarwal PEzra ESharir M(2012)Near-Linear Approximation Algorithms for Geometric Hitting SetsAlgorithmica10.5555/3226239.322636963:1-2(1-25)Online publication date: 1-Jun-2012
https://dl.acm.org/doi/10.5555/3226239.3226369
Arya Sda Fonseca GMount D(2012)Polytope approximation and the Mahler volumeProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095119(29-42)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095119
Show More Cited By

Abstract

Cited By

Recommendations

Facets and lifting procedures for the set covering polytope

On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}

On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations