scientific article; zbMATH DE number 6820216
From MaRDI portal
Publication:4598163
DOI10.4230/LIPIcs.ICALP.2016.27zbMath1388.68228arXiv1707.06808MaRDI QIDQ4598163
Dániel Marx, Andreas Emil Feldmann
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1707.06808
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (9)
Unnamed Item ⋮ On Directed Steiner Trees with Multiple Roots ⋮ Unnamed Item ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. ⋮ Complexity of the Steiner Network Problem with Respect to the Number of Terminals ⋮ Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
This page was built for publication:
