This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
Evaggelia Matskani, Nikos D. Sidiropoulos, Leandro...