pdfformat: 

@InProceedings{chang_et_al:LIPIcs:2015:5092, author = {HsienChih Chang and Sariel HarPeled and Benjamin Raichel}, title = {{From Proximity to Utility: A Voronoi Partition of Pareto Optima}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {689703}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897835}, ISSN = {18688969}, year = {2015}, volume = {34}, editor = {Lars Arge and J{\'a}nos Pach}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5092}, URN = {urn:nbn:de:0030drops50925}, doi = {10.4230/LIPIcs.SOCG.2015.689}, annote = {Keywords: Voronoi diagrams, expected complexity, backward analysis, Pareto optima, candidate diagram, ClarksonShor technique} }
Keywords:  Voronoi diagrams, expected complexity, backward analysis, Pareto optima, candidate diagram, ClarksonShor technique  
Seminar:  31st International Symposium on Computational Geometry (SoCG 2015)  
Issue date:  2015  
Date of publication:  2015 