scientific article; zbMATH DE number 7236452
From MaRDI portal
Publication:5115816
DOI10.4230/LIPIcs.SoCG.2018.48zbMath1489.68360MaRDI QIDQ5115816
Bruno Jartoux, Nabil H. Mustafa
Publication date: 18 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (3)
On the geometric set multicover problem ⋮ Constructing planar support for non-piercing regions ⋮ Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.
Cites Work
- Unnamed Item
- Unnamed Item
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Sparsity. Graphs, structures, and algorithms
- Approximation algorithms for maximum independent set of pseudo-disks
- Limits of local search: quality and efficiency
- Improved results on geometric hitting set problems
- Unit disk graphs
- Simple PTAS's for families of graphs excluding a minor
- Independent set of intersection graphs of convex objects in 2D
- Geometric packing under non-uniform constraints
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
- An Approximation Scheme for Terrain Guarding
- Fast approximation algorithms for a nonconvex covering problem
- A Separator Theorem for Nonplanar Graphs
- Separators for sphere-packings and nearest neighbor graphs
- Packing and Covering with Non-Piercing Regions
- Local Search Heuristics for k-Median and Facility Location Problems
- Approximation Schemes for Covering and Packing
- Algorithms – ESA 2005
- An inequality related to the isoperimetric inequality
This page was built for publication:
