209 search results - page 28 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
160
click to vote
APPROX
2009
Springer
16 years 14 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
147
click to vote
ICDCS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
141
click to vote
JUCS
2010
15 years 4 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
158
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
145
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...