![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record journals/corr/abs-1908-09648
@article{DBLP:journals/corr/abs-1908-09648, author = {Nicolas Dupin and Frank Nielsen and El{-}Ghazali Talbi}, title = {Planar p-center problems are solvable in polynomial time when clustering a Pareto Front}, journal = {CoRR}, volume = {abs/1908.09648}, year = {2019}, url = {http://arxiv.org/abs/1908.09648}, eprinttype = {arXiv}, eprint = {1908.09648}, timestamp = {Thu, 29 Aug 2019 16:32:34 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1908-09648.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.