628 search results - page 93 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
146
Voted
ICDM
2010
IEEE
15 years 18 days ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
122
Voted
FOCS
1992
IEEE
15 years 6 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
143
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
126
Voted
DAM
2010
15 years 2 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...