153 search results - page 21 / 31 » Approximating node connectivity problems via set covers |
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
ADHOC
2007
14 years 10 months ago
2007
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
APPROX
2007
Springer
15 years 1 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
DIALM
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...