scientific article; zbMATH DE number 7204986
From MaRDI portal
Publication:5111691
DOI10.4230/LIPIcs.ESA.2017.8zbMath1442.05041MaRDI QIDQ5111691
Claire Mathieu, Daniel Antunes, Nabil H. Mustafa
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Local search is a PTAS for feedback vertex set in minor-free graphs ⋮ Constructing planar support for non-piercing regions ⋮ Unnamed Item ⋮ A tight analysis of geometric local search
Cites Work
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Approximation algorithms for maximum independent set of pseudo-disks
- Limits of local search: quality and efficiency
- Improved results on geometric hitting set problems
- Simple PTAS's for families of graphs excluding a minor
- Independent set of intersection graphs of convex objects in 2D
- Guarding terrains via local search
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Geometric Hitting Sets for Disks: Theory and Practice
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
- Packing and Covering with Non-Piercing Regions
- Polynomial-time approximation schemes for packing and piercing fat objects
- Approximation Schemes for Covering and Packing
- Algorithms – ESA 2005
- Unnamed Item
This page was built for publication:
