The point-to-point delivery and connection problems: Complexity and algorithms
From MaRDI portal
Publication:1193725
DOI10.1016/0166-218X(92)90258-CzbMath0761.68022OpenAlexW1991636386MaRDI QIDQ1193725
Chung-Lun Li, David Simchi-Levi, S. Thomas McCormick
Publication date: 27 September 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)90258-c
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (8)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Linkage on the infinite grid ⋮ The point-to-point connection problem - analysis and algorithms ⋮ On the point-to-point connection problem ⋮ The \(k\)-path tree matroid and its applications to survivable network design ⋮ Online Node-weighted Steiner Forest and Extensions via Disk Paintings ⋮ Parameterized certificate dispersal and its variants ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Cites Work
- The complexity of finding two disjoint paths with min-max objective function
- Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Rectilinear steiner trees: Efficient special-case algorithms
- On the Complexity of Timetable and Multicommodity Flow Problems
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- Fibonacci heaps and their uses in improved network optimization algorithms
- The steiner problem in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The point-to-point delivery and connection problems: Complexity and algorithms
