This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious facilities. If weâ€¦ (More)

This paper deals with facility location problems with pos/neg weights in trees. We consider two diierent objective functions which model two different ways to handle obnoxious facilities. If weâ€¦ (More)

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. Weâ€¦ (More)

| We analytically model continuous multicasting to uniformly-distributed destinations on statically-allocated VC-based switches. Our models compare favorably with simulations. Our results indicateâ€¦ (More)

In this paper we consider diierent aspects of robust 1-median problems on a tree network with uncertain or dynamically changing edge lengths and vertex weights which can also take negative values.â€¦ (More)