203 search results - page 5 / 41 » On Span Programs |
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
JCM
2007
13 years 9 months ago
2007
— In this paper we introduce two operations of access structure to build large monotone span programs MSPs from small MSPs. Furthermore, we point out a new method of constructing...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
ESA
1998
Springer
14 years 2 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...