121 search results - page 10 / 25 » Upper Bounds on Number of Steals in Rooted Trees |
104
Voted
SKG
2006
IEEE
15 years 7 months ago
2006
IEEE
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
104
click to vote
HM
2007
Springer
15 years 8 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
131
click to vote
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
122
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
111
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...