Randomized approximation scheme for Steiner multi cycle in the Euclidean plane

DOI10.1016/j.tcs.2020.06.022zbMath1452.68138OpenAlexW3036915266WikidataQ114129156 ScholiaQ114129156MaRDI QIDQ2192387

Carla Negri Lintzmayer, Flávio K. Miyazawa, Phablo F. S. Moura, Eduardo Candido Xavier

Publication date: 17 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.06.022

zbMATH Keywords

approximation algorithmEuclidean planerandomized algorithmSteiner multi-cycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Approximations for the Steiner multicycle problem

Cites Work

• Unnamed Item
• Approximability of the minimum-weight \(k\)-size cycle cover problem
• Approximation schemes for Euclidean vehicle routing problems with time windows
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• Shipper collaboration
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• The Steiner cycle polytope
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

This page was built for publication: Randomized approximation scheme for Steiner multi cycle in the Euclidean plane