Binayak Dutta, Sasanka Roy. Approximate Shortest Paths in Polygons with Violations. In Yingshu Li, Mihaela Cardei, Yan Huang, editors, Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings. Volume 11949 of Lecture Notes in Computer Science, pages 168-180, Springer, 2019. [doi]
@inproceedings{DuttaR19-0,
title = {Approximate Shortest Paths in Polygons with Violations},
author = {Binayak Dutta and Sasanka Roy},
year = {2019},
doi = {10.1007/978-3-030-36412-0_14},
url = {https://doi.org/10.1007/978-3-030-36412-0_14},
researchr = {https://researchr.org/publication/DuttaR19-0},
cites = {0},
citedby = {0},
pages = {168-180},
booktitle = {Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings},
editor = {Yingshu Li and Mihaela Cardei and Yan Huang},
volume = {11949},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-36412-0},
}