Approximation algorithms for free-label maximization
From MaRDI portal
Publication:419365
Recommendations
Cites work
- A note on maximum independent sets in rectangle intersection graphs
- Algorithms and Computation
- Approximation algorithms for free-label maximization
- Approximation schemes for covering and packing problems in image processing and VLSI
- Computational geometry. Algorithms and applications.
- Consistent labeling of rotating maps
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Introduction to algorithms.
- Labeling points with weights
- Maximum independent set of rectangles
- Optimal packing and covering in the plane are NP-complete
- Optimizing active ranges for consistent dynamic map labeling
- Point labeling with sliding labels
- Trimming of graphs, with application to point 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)