535 search results - page 27 / 107 » Generalized Version Space Trees |
CCCG
2008
15 years 1 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
105
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
114
click to vote
PEPM
2000
ACM
15 years 3 months ago
2000
ACM
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
TCS
2008
14 years 11 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...