628 search results - page 39 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
134
Voted
CATA
2004
15 years 4 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
121
Voted
IPL
2002
15 years 2 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
112
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
146
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
131
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...