English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

MPS-Authors
/persons/resource/persons252863

Węgrzycki,  Karol       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2209.08904.pdf
(Preprint), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Dross, F., Fleszar, K., Węgrzycki, K., & Zych-Pawlewicz, A. (2023). Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1433-1463). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch52.


Cite as: https://hdl.handle.net/21.11116/0000-000C-1F6C-A
Abstract
There is no abstract available