Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximating Node-Connectivity Augmentation Problems

From MaRDI portal
Publication:3638884
Jump to:navigation, search

DOI10.1007/978-3-642-03685-9_22zbMath1255.68308OpenAlexW2750693896MaRDI QIDQ3638884

Zeev Nutov

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_22



Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)


Related Items (3)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Approximating node-connectivity augmentation problems ⋮ A note on Rooted Survivable Networks







This page was built for publication: Approximating Node-Connectivity Augmentation Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3638884&oldid=17080241"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 05:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki