16404 search results - page 811 / 3281 » A set coverage problem |
190
click to vote
JAIR
2008
15 years 7 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
241
click to vote
JSAC
2006
15 years 7 months ago
2006
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
184
click to vote
JDA
2007
15 years 7 months ago
2007
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
166
click to vote
DM
2002
15 years 7 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
178
click to vote
DAM
1998
15 years 7 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...