Back to Results
First PageMeta Content
Graph theory / Computational complexity theory / Mathematics / Spanning tree / NP-complete problems / Approximation algorithms / Steiner tree problem / Complexity classes / APX / Combinatorial optimization / Minimum spanning tree / Cut


Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,
Add to Reading List

Document Date: 2013-11-01 17:11:36


Open Document

File Size: 551,42 KB

Share Result on Facebook