The point-to-point connection problem - analysis and algorithms

DOI10.1016/S0166-218X(97)00010-3MaRDI QIDQ1377667zbMATH OpenFDO

Authors Madan Natu, Shu-Cherng Fang

Publication date 11 June 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

time complexityDijkstra-like algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• On the point-to-point connection problem
• The point-to-point delivery and connection problems: Complexity and algorithms
• Optimal connection problem of single source multiple sinks on directed networks
• Efficient points on a network

Cites work

• scientific article; zbMATH DE number 3742993 (Why is no real title available?)
• scientific article; zbMATH DE number 742977 (Why is no real title available?)
• An efficiently solvable case of the minimum weight equivalent subgraph problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding a minimum equivalent graph of a digraph
• Graph theory
• On the point-to-point connection problem
• Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
• Steiner's problem in graphs and its implications
• The Steiner tree problem
• The point-to-point delivery and connection problems: Complexity and algorithms
• The steiner problem in graphs

Cited in

(11)

• Parameterized certificate dispersal and its variants
• The \(k\)-path tree matroid and its applications to survivable network design
• Optimal connection problem of single source multiple sinks on directed networks
• A multivariate analysis of the strict terminal connection problem
• Cost of sequential connection for points in space
• Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
• Construction Line Algorithms for the Connection Location-Allocation Problem
• Augmenting weighted graphs to establish directed point-to-point connectivity
• Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
• Connection problems in mountains and monotonic allocation schemes.
• The point-to-point delivery and connection problems: Complexity and algorithms

This page was built for publication: The point-to-point connection problem - analysis and algorithms

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