433 search results - page 24 / 87 » A greedy approximation algorithm for the group Steiner probl... |
SIAMCOMP
2008
13 years 8 months ago
2008
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
SIAMDM
2008
13 years 8 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
ESA
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...