scientific article; zbMATH DE number 1445321
From MaRDI portal
Publication:4952636
Recommendations
Cited in
(14)- Exact solutions for the Steiner path cover problem on special graph classes
- The polymatroid Steiner problems
- A greedy approximation algorithm for the group Steiner problem
- Approximation algorithms for union and intersection covering problems
- scientific article; zbMATH DE number 5899242 (Why is no real title available?)
- Universal approximations for TSP, Steiner tree, and set cover
- Approximation algorithms for the covering Steiner problem
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- scientific article; zbMATH DE number 2119643 (Why is no real title available?)
- RNC-approximation algorithms for the steiner problem
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Algorithms and Computation
- A tight bound on approximating arbitrary metrics by tree metrics
- Russian doll search for the Steiner triple covering problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952636)
