574 search results - page 13 / 115 » Approximation Algorithms for Free-Label Maximization |
122
click to vote
JGAA
2000
15 years 1 months ago
2000
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...
105
Voted
TCS
2008
15 years 1 months ago
2008
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 ...
129
click to vote
ICC
2009
IEEE
14 years 11 months ago
2009
IEEE
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 "...
150
Voted
INFOCOM
2010
IEEE
15 years 9 days ago
2010
IEEE
—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...
130
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
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...