On the point-to-point connection problem

DOI10.1016/0020-0190(94)00216-LzbMath0875.68444OpenAlexW2077731214MaRDI QIDQ673909

Madan Natu, Shu-Cherng Fang

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00216-l

zbMATH Keywords

AlgorithmsDynamic programmingComputational complexityPoint-to-point connection problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ The point-to-point connection problem - analysis and algorithms ⋮ Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs ⋮ The \(k\)-path tree matroid and its applications to survivable network design

Cites Work

• Unnamed Item
• The point-to-point delivery and connection problems: Complexity and algorithms
• 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

This page was built for publication: On the point-to-point connection problem