783 search results - page 9 / 157 » Improved approximation algorithms for the freeze-tag problem |
IPCO
1996
13 years 10 months ago
1996
CORR
2008
Springer
13 years 8 months ago
2008
Springer
ESA
2007
Springer
14 years 2 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
CCCG
2006
13 years 10 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...