4255 search results - page 6 / 851 » Cover |
HICSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
DSP
2007
13 years 7 months ago
2007
ww.elsevier.com/locate/dsp including abstract, keywords, a cover page containing the title and Author(s) name(s), corresponding
FOCS
2002
IEEE
14 years 12 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
AAAI
2007
13 years 9 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
MST
2007
13 years 7 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...