666 search results - page 53 / 134 » New primal-dual algorithms for Steiner tree problems |
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
AAAI
2006
13 years 10 months ago
2006
This paper is concerned with the problem of structured data extraction from Web pages. The objective of the research is to automatically segment data records in a page, extract da...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
The visual world demonstrates organized spatial patterns,
among objects or regions in a scene, object-parts
in an object, and low-level features in object-parts. These
classes o...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...