Local search for weighted tree augmentation and Steiner tree

DOI10.1137/1.9781611977073.128MaRDI QIDQ6575209zbMATH OpenFDO

Authors Vera Traub, Rico Zenklusen

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.128

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(12)

• Approximation algorithms for node and element connectivity augmentation problems
• Streaming algorithms for connectivity augmentation
• On the bidirected cut relaxation for Steiner forest
• Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
• Improved approximation algorithms for covering pliable set families and flexible graph connectivity
• Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
• Hypergraph connectivity augmentation in strongly polynomial time
• Approximation algorithms for Steiner connectivity augmentation
• Parameterized algorithms for node connectivity augmentation problems
• Survivable network design with group-to-group requirement
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: Local search for weighted tree augmentation and Steiner tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575209)