Degrees and network design: new problems and approximations
From MaRDI portal
Cites work
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A unified approach to scheduling on unrelated parallel machines
- Algorithm Theory - SWAT 2004
- All-norms and all-L_p-norms approximation algorithms
- Analytical approach to parallel repetition
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Approximating the norms of graph spanners
- Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- Improved approximations for unrelated machine scheduling
- Iterative methods in combinatorial optimization.
- NC-algorithms for graphs with small treewidth
- On approximating degree-bounded network design problems
- Polylogarithmic approximations for robust s-t path
- Polylogarithmic inapproximability
- Survivable network design with degree or order constraints
- The minimum degree group Steiner problem
- The norms of graph spanners
This page was built for publication: Degrees and network design: new problems and approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920843)
