Eth-tight algorithms for geometric network problems using geometric separators

Research output: Contribution to conferencePaperAcademic

Original languageEnglish
Pages225
Number of pages1
Publication statusPublished - 2019
Event31st Canadian Conference on Computational Geometry, CCCG 2019 - Edmonton, Canada
Duration: 8 Aug 201910 Aug 2019

Conference

Conference31st Canadian Conference on Computational Geometry, CCCG 2019
CountryCanada
CityEdmonton
Period8/08/1910/08/19

Cite this

de Berg, M. (2019). Eth-tight algorithms for geometric network problems using geometric separators. 225. Paper presented at 31st Canadian Conference on Computational Geometry, CCCG 2019, Edmonton, Canada.