4843 search results - page 66 / 969 » The Shortcut Problem - Complexity and Approximation |
ALGORITHMICA
2011
14 years 1 months ago
2011
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
IACR
2011
13 years 9 months ago
2011
SODA
2012
ACM
13 years 11 days ago
2012
ACM
AAIM
2010
Springer
15 years 1 months ago
2010
Springer
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...