478 search results - page 11 / 96 » Approximation algorithms for general packing problems and th... |
IPL
2008
13 years 8 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
DAM
2007
13 years 8 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
INFOCOM
2007
IEEE
2007
IEEE
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion
14 years 2 months ago
Abstract—In this paper we consider the problem of distinguishing whether frame loss at the MAC layer has occurred due to mobility or congestion. Most ad hoc routing protocols mak...