216 search results - page 10 / 44 » Covering Problems with Hard Capacities |
CIAC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...