Fast approximation schemes for Euclidean multi-connectivity problems. (Extended abstract)

DOI10.1007/3-540-45022-X_72MaRDI QIDQ2754202zbMATH OpenFDO

Authors Artur Czumaj, Andrzej Lingas

Publication date 9 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://lup.lub.lu.se/record/526600

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• A polynomial time approximation scheme for Euclidean minimum cost k-connectivity
• Improved Approximation Algorithms for Uniform Connectivity Problems
• scientific article; zbMATH DE number 1305417
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• scientific article; zbMATH DE number 2086687

Cited in

(9)

• Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane
• Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• A polynomial time approximation scheme for Euclidean minimum cost k-connectivity
• scientific article; zbMATH DE number 1305417 (Why is no real title available?)
• A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing
• scientific article; zbMATH DE number 2086687 (Why is no real title available?)
• A unified framework for light spanners
• A unified framework of light spanners. I: Fast (yet optimal) constructions

This page was built for publication: Fast approximation schemes for Euclidean multi-connectivity problems. (Extended abstract)

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