Approximation algorithms for free-label maximization
From MaRDI portal
Publication:419365
DOI10.1016/J.COMGEO.2011.10.004zbMATH Open1242.65042OpenAlexW2030174981MaRDI QIDQ419365FDOQ419365
Authors: Dirk H. P. Gerrits, Mark de Berg 
Publication date: 18 May 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.10.004
Recommendations
algorithmsmap labelingair-traffic controlfree-label maximizationlabel-placement modelsmoving objectspoint-labeling problem
Cites Work
- Introduction to algorithms.
- Computational geometry. Algorithms and applications.
- Approximation schemes for covering and packing problems in image processing and VLSI
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Point labeling with sliding labels
- Optimal packing and covering in the plane are NP-complete
- Maximum independent set of rectangles
- A note on maximum independent sets in rectangle intersection graphs
- Labeling points with weights
- Approximation algorithms for free-label maximization
- Trimming of graphs, with application to point labeling
- Consistent labeling of rotating maps
- Algorithms and Computation
- Optimizing active ranges for consistent dynamic map labeling
Cited In (6)
This page was built for publication: Approximation algorithms for free-label maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419365)
