Routing multi-class traffic flows in the plane (Q427052): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An optimal algorithm for finding the separation of simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum thick paths in static and dynamic environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow, well-linked terminals, and routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Planning in 0/1/∞ Weighted Regions with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum flows in polyhedral domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thick non-crossing paths and minimum-cost flows in polygonal domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal flow through a domain / rank
 
Normal rank

Latest revision as of 08:50, 5 July 2024

scientific article
Language Label Description Also known as
English
Routing multi-class traffic flows in the plane
scientific article

    Statements

    Routing multi-class traffic flows in the plane (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2012
    0 references
    0 references
    optimal paths
    0 references
    geometric maximum flow
    0 references
    multi-commodity flow
    0 references
    approximation algorithms
    0 references
    air traffic management
    0 references
    0 references