An algorithmic framework for labeling network maps

DOI10.1007/s00453-017-0350-0zbMath1390.68725arXiv1505.00164OpenAlexW2911675809WikidataQ58824784 ScholiaQ58824784MaRDI QIDQ1750356

Jan-Henrik Haunert, Benjamin Niedermann

Publication date: 18 May 2018

Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.00164

zbMATH Keywords

labelingdynamic programminginteger linear programmingexperimental evaluationcomputational cartographymetro maps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Dynamic programming (90C39) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Consistent dynamic map labeling with fairness and importance ⋮ An algorithmic framework for labeling network maps

Cites Work

• Unnamed Item
• Unnamed Item
• Edge routing with ordered bundles
• Optimal packing and covering in the plane are NP-complete
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Label placement by maximum independent set in rectangles
• An algorithmic framework for labeling network maps
• An Improved Algorithm for the Metro-line Crossing Minimization Problem
• Planar Formulae and Their Uses
• Drawing Metro Maps Using Bézier Curves

This page was built for publication: An algorithmic framework for labeling network maps