Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

@article{Pilipczuk2018QuasipolynomialTA,
  title={Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs},
  author={Michal Pilipczuk and E. J. V. Leeuwen and A. Wiese},
  journal={ArXiv},
  year={2018},
  volume={abs/1807.07626}
}
We consider two optimization problems in planar graphs. In {Maximum Weight Independent Set of Objects} we are given a graph G and a family D of {objects}, each being a connected subgraph of G with a prescribed weight, and the task is to find a maximum-weight subfamily of D consisting of pairwise disjoint objects. In {Minimum Weight Distance Set Cover} we are given an edge-weighted graph G, two sets D,C of vertices of G, where vertices of D have prescribed weights, and a nonnegative radius r… Expand

References

SHOWING 1-8 OF 8 REFERENCES
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
  • 35
  • PDF
Approximation Schemes for Maximum Weight Independent Set of Rectangles
  • A. Adamaszek, A. Wiese
  • Mathematics, Computer Science
  • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
  • 81
  • PDF
Finding small simple cycle separators for 2-connected planar graphs.
  • G. Miller
  • Mathematics, Computer Science
  • STOC '84
  • 1984
  • 116
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
  • Sariel Har-Peled
  • Computer Science, Mathematics
  • Symposium on Computational Geometry
  • 2014
  • 39
  • PDF
Call routing and the ratcatcher
  • 347