Routing multi-class traffic flows in the plane
From MaRDI portal
Publication:427052
DOI10.1016/j.comgeo.2011.09.003zbMath1239.90026OpenAlexW2052075839MaRDI QIDQ427052
Valentin Polishchuk, Joseph S. B. Mitchell, Shang Yang, Jingyu Zou, Joondong Kim
Publication date: 13 June 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.09.003
air traffic managementapproximation algorithmsmulti-commodity flowgeometric maximum flowoptimal paths
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On maximum flows in polyhedral domains
- Multicommodity flow, well-linked terminals, and routing problems
- Thick non-crossing paths and minimum-cost flows in polygonal domains
- Maximal flow through a domain
- Path Planning in 0/1/∞ Weighted Regions with Applications
- An optimal algorithm for finding the separation of simple polygons
- Maximum thick paths in static and dynamic environments
This page was built for publication: Routing multi-class traffic flows in the plane