A network-flow technique for finding low-weight bounded-degree spanning trees

Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal Young

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Fingerprint

Dive into the research topics of 'A network-flow technique for finding low-weight bounded-degree spanning trees'. Together they form a unique fingerprint.

Computer Science

Mathematics