Compact Location Problems with Budget and Communication Constraints


We consider the problem of placing a speciied number p of facilities on the nodes of a given network with two nonnegative edge{ weight functions so as to minimize the diameter of the placement with respect to the rst weight function subject to a diameter{ or sum{ constraint with respect to the second weight function. Deene an (;){approximation algorithm as… (More)
DOI: 10.1007/BFb0030872


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics