The polymatroid Steiner problems
From MaRDI portal
Publication:2569165
DOI10.1007/s10878-005-1412-9zbMath1115.68109OpenAlexW1975361422MaRDI QIDQ2569165
Alexander Z. Zelikovsky, Gruia Călinescu
Publication date: 18 October 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-1412-9
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (7)
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ On maximum leaf trees and connections to connected maximum cut problems ⋮ Adaptive Submodular Ranking and Routing ⋮ Approximation algorithms for the connected sensor cover problem ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ On fixed cost \(k\)-flow problems ⋮ Multi-rooted greedy approximation of directed Steiner trees with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- An analysis of the greedy algorithm for the submodular set covering problem
- A greedy approximation algorithm for the group Steiner problem
- An improved approximation scheme for the Group Steiner Problem
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
- Polylogarithmic inapproximability
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Approximation algorithms for the covering Steiner problem
- Approximation Algorithms for Directed Steiner Problems
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Algorithms - ESA 2003
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: The polymatroid Steiner problems
