Arrow Research search
Back to STOC

STOC 2003

Primal-dual meets local search: approximating MST's with nonuniform degree bounds

Conference Paper Session 7B Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
417125815372941927
v2026.09.13