26 search results - page 1 / 6 » Deterministic Edge Weights in Increasing Tree Families |
CPC
2010
13 years 5 months ago
2010
NETWORKS
2008
13 years 5 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
ACTA
2008
13 years 3 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
DM
2008
13 years 5 months ago
2008
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...