On \(d\)-regular schematization of embedded paths

DOI10.1016/j.comgeo.2013.10.002zbMath1292.65017OpenAlexW2031367758MaRDI QIDQ390156

Ignaz Rutter, Martin Nöllenburg, Thomas Pajor, Daniel Delling, Andreas Gemsa

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.10.002

zbMATH Keywords

dynamic programmingmixed integer linear programminggraph drawingNP-hardnesspath schematization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Traffic problems in operations research (90B20)

Related Items (2)

Universal slope sets for upward planar drawings ⋮ On d-Regular Schematization of Embedded Paths

This page was built for publication: On \(d\)-regular schematization of embedded paths