Regular ArticleA Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees☆,☆☆
Under a Creative Commons license
open archive
Cited by (0)
- ☆
A preliminary version of this paper appeared in “Proceedings of the 5th International Integer Programming and Combinatorial Optimization Conference (IPCO), June 1996,” pp. 105–117.
- ☆☆
B. Roy, Ed.
- †
E-mail: [email protected].
- ‡
Research supported by NSF Research Initiation Award CCR-9307462 and an NSF CAREER Award CCR-9501355. E-mail: [email protected].
- §
E-mail: [email protected].
- ∥
Research supported in part by NSF Research Initiation Award CCR-9409625. E-mail: [email protected].
- ¶
Part of this research was done while at the School of ORIE, Cornell University, Ithaca, NY 14853 supported by Éva Tardos' NSF PYI Grant DDM-9157199. E-mail: [email protected].
Copyright © 1997 Academic Press. All rights reserved.