109 search results - page 3 / 22 » Vertex Ranking with Capacity |
CGF
2007
13 years 9 months ago
2007
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
EUSFLAT
2007
13 years 11 months ago
2007
We investigate in this paper the set of kadditive capacities dominating a given capacity, which we call the k-additive core. We study its structure through achievable families, wh...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
COR
2006
13 years 9 months ago
2006
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...