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

DOI10.1016/S0166-218X(97)00010-3zbMATH Open0890.68104MaRDI QIDQ1377667FDOQ1377667

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

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

zbMATH Keywords

time complexityDijkstra-like algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

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

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)