109 search results - page 2 / 22 » Vertex Ranking with Capacity |
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
FOCS
2002
IEEE
13 years 10 months 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...
IANDC
2008
13 years 5 months ago
2008
SIAMDM
2010
13 years 3 months ago
2010
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
SIAMCOMP
2008
13 years 5 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...