Bichromatic 2-Center of Pairs of Points

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10129983" target="_blank" >RIV/00216208:11320/12:10129983 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-29344-3_3" target="_blank" >http://dx.doi.org/10.1007/978-3-642-29344-3_3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-29344-3_3" target="_blank" >10.1007/978-3-642-29344-3_3</a>

Result language
angličtina
Original language name
Bichromatic 2-Center of Pairs of Points
Original language description
We study a class of geometric optimization problems closely related to the 2-center problem: Given a set S of n pairs of points, assign to each point a color ("red" or "blue") so that each pair's points are assigned different colors and a function of theradii of the minimum enclosing balls of the red points and the blue points, respectively, is optimized. In particular, we consider the problems of minimizing the maximum and minimizing the sum of the two radii. For each case, minmax and minsum, we consider distances measured in the L 2 and in the L oo metrics. Our problems are motivated by a facility location problem in transportation system design, in which we are given origin/destination pairs of points for desired travel, and our goal is to locate an optimal road/flight segment in order to minimize the travel to/from the endpoints of the segment.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)