A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
The seminar was held from April 28 to May 3, 2019 and 40 participants from various countries attended it. New advances and directions in computational geometry were presented and discussed. ... This report documents the program and the outcomes of Dagstuhl Seminar 19181 "Computational Geometry". ... International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., LIPIcs, Vol. 129, pp. 49:1-49:19, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2019. ...doi:10.4230/dagrep.9.4.107 dblp:journals/dagstuhl-reports/ChengD019 fatcat:w2kqoyd5mngt7bn32gc25w4jie
On the other hand, we give a (1+ϵ)-approximation for 1-center in Ulam metric with running time Õ_̃ϵ̃(nd+n^2√(d)). ... Our results for the 1-center problem may be classified based on d as follows. ∙ Small d: We provide the first linear-time algorithm for 1-center problem in fixed-dimensional ℓ_1 metrics. ... In Gill Barequet and Yusu Wang, editors, 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA, volume 129 of LIPIcs, pages ...arXiv:2112.03222v1 fatcat:qlknjrjlqzdtdely3eq45cvsmu