36 search results - page 5 / 8 » Polynomial-time Algorithms from Ineffective Proofs |
IPSN
2005
Springer
14 years 3 months ago
2005
Springer
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...