Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph - MaRDI portal

An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph

From MaRDI portal

Publication:5317594

Jump to:navigation, search

DOI10.1137/S0895480102414910zbMath1082.05087MaRDI QIDQ5317594

Harold N. Gabow

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

multigraphs network design graph connectivity approximation algorithms edge connectivity laminar family

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (2)

Approximating the smallest k -edge connected spanning subgraph by LP-rounding ⋮ Flexible graph connectivity

This page was built for publication: An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5317594&oldid=19995961"