Sciweavers

4843 search results - page 66 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ALGORITHMICA
2011
14 years 6 months ago
Approximating Minimum-Power Degree and Connectivity Problems
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena...
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
13 years 5 months ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
15 years 6 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin