65 search results - page 12 / 13 » The (K, k)-Capacitated Spanning Tree Problem |
187
click to vote
WADS
2007
Springer
16 years 2 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
185
click to vote
CIE
2007
Springer
16 years 4 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
208
click to vote
JPDC
2006
15 years 6 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
205
click to vote
CORR
2011
Springer
15 years 29 days ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
187
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...