A unified model and algorithms for temporal map labeling
From MaRDI portal
Publication:2006937
Recommendations
Cites work
- Algorithms – ESA 2005
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Approximation Algorithms on Consistent Dynamic Map Labeling
- Consistent labeling of rotating maps
- Dynamic point labeling is strongly PSPACE-complete
- Evaluation of labeling strategies for rotating maps
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Labeling moving points with a trade-off between label speed and label overlap
- On the \(k\)-coloring of intervals
- On the readability of boundary labeling
- Optimal packing and covering in the plane are NP-complete
- Optimizing active ranges for consistent dynamic map labeling
Cited in
(7)- Parametrized runtimes for label tournaments
- Consistent dynamic map labeling with fairness and importance
- Solving dynamic labeling problems to optimality using solution space reductions
- Approximation algorithms on consistent dynamic map labeling
- Trajectory-based dynamic map labeling
- Evaluation of labeling strategies for rotating maps
- Optimizing active ranges for consistent dynamic map labeling
This page was built for publication: A unified model and algorithms for temporal map labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006937)