Sciweavers

IJCGA
2000
85views more  IJCGA 2000»
13 years 4 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
IPPS
2003
IEEE
13 years 10 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...