628 search results - page 26 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
149
click to vote
WINE
2010
Springer
15 years 25 days ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
165
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
135
click to vote
SIAMCOMP
2000
15 years 2 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
133
click to vote
DEXA
2010
Springer
15 years 3 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
140
click to vote
NETWORKS
2010
15 years 1 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...