Constructing pairwise disjoint paths with few links

DOI10.1145/1273340.1273342zbMATH Open1192.68744OpenAlexW2088485107MaRDI QIDQ3580937FDOQ3580937

Authors Himanshu Gupta, Rephael Wenger

Publication date 14 August 2010

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1273340.1273342

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Constructing pairwise disjoint paths with few links
• Disjoint Paths in the Plane
• CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
• k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
• On shortest disjoint paths in planar graphs

Cited in

(4)

• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
• On compatible triangulations with a minimum number of Steiner points
• Geodesic-preserving polygon simplification
• Constructing pairwise disjoint paths with few links

This page was built for publication: Constructing pairwise disjoint paths with few links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580937)