The point-to-point connection problem - analysis and algorithms
From MaRDI portal
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 3742993 (Why is no real title available?)
- scientific article; zbMATH DE number 742977 (Why is no real title available?)
- 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 point-to-point delivery and connection problems: Complexity and algorithms
- The steiner problem in graphs
- The Steiner tree problem
Cited in
(13)- Cost of sequential connection for points in space
- The point-to-point delivery and connection problems: Complexity and algorithms
- A multivariate analysis of the strict terminal connection 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)
- Optimal connection problem of single source multiple sinks on directed networks
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- Construction Line Algorithms for the Connection Location-Allocation Problem
- Parameterized certificate dispersal and its variants
- On the point-to-point connection problem
- Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
- Connection problems in mountains and monotonic allocation schemes.
- 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)
