109 search results - page 2 / 22 » Vertex Ranking with Capacity |
149
Voted
ICALP
2003
Springer
16 years 19 days ago
2003
Springer
224
click to vote
FOCS
2002
IEEE
16 years 11 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...
160
Voted
IANDC
2008
15 years 7 months ago
2008
210
click to vote
SIAMDM
2010
15 years 5 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 ...
194
Voted
SIAMCOMP
2008
15 years 7 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...