Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
DOI10.1142/S0129054118500302zbMATH Open1415.68160OpenAlexW2900751082WikidataQ128990706 ScholiaQ128990706MaRDI QIDQ5384532FDOQ5384532
Authors: Mehdy Roayaei, Mohammadreza Razzazi 
Publication date: 24 June 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118500302
Recommendations
- Parameterized complexity of arc-weighted directed Steiner problems
- Parameterized complexity of arc-weighted directed Steiner problems
- The complexity landscape of fixed-parameter directed Steiner network problems
- Parameterized complexity of directed Steiner tree on sparse graphs
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
- Parameterized approximation algorithms for bidirected Steiner network problems
- An approach for the Steiner problem in directed graphs
- Approximation Algorithms for Directed Steiner Problems
parameterized complexityoutput-sensitive algorithmdirected Steiner networkjunction vertexshared segment
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Improved approximation for orienting mixed graphs
- Title not available (Why is that?)
- Finding the K Shortest Loopless Paths in a Network
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- On the parameterized complexity of multiple-interval graph problems
- Title not available (Why is that?)
- Optimal orientations of graphs and digraphs: A survey
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- On the point-to-point connection problem
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- The point-to-point connection problem - analysis and algorithms
- Parameterized complexity of arc-weighted directed Steiner problems
Cited In (4)
This page was built for publication: Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384532)
