Deterministic Sampling Algorithms for Network Design

DOI10.1007/978-3-540-87744-8_69MaRDI QIDQ3541137zbMATH OpenOpenAlexFDO

Authors Anke van Zuylen

Publication date 25 November 2008

Published in Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87744-8_69

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Deterministic sampling algorithms for network design
• Simpler and better approximation algorithms for network design
• Connected facility location via random facility sampling and core detouring
• Network design via core detouring for problems without a core
• Random sampling in cut, flow, and network design problems

Cited in

(7)

• Simpler and better approximation algorithms for network design
• Deterministic sampling algorithms for network design
• scientific article; zbMATH DE number 7204953 (Why is no real title available?)
• Random sampling in cut, flow, and network design problems
• Network design via core detouring for problems without a core
• Connected facility location via random facility sampling and core detouring
• Pseudorandomness for network algorithms

This page was built for publication: Deterministic Sampling Algorithms for Network Design

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