Publication:4360134: Difference between revisions
From MaRDI portal
Publication:4360134
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees to A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees: Duplicate |
(No difference)
| |
Latest revision as of 16:04, 2 May 2024
DOI10.1006/jagm.1997.0862zbMath0895.68107arXivcs/0205050MaRDI QIDQ4360134
Sándor P. Fekete, Samir Khuller, Neal E. Young, Balaji Raghavachari, Monika Klemmstein
Publication date: 20 September 1998
Published in: Journal of Algorithms, Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0205050
edge weight; performance guarantee; positive flow; low-weight spanning tree; minimum span tree; span tree
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
68W10: Parallel algorithms in computer science
Related Items
