4843 search results - page 171 / 969 » The Shortcut Problem - Complexity and Approximation |
130
click to vote
ALGOSENSORS
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
STOC
2002
ACM
16 years 3 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
104
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
102
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ï¬...
224
click to vote
SIAMCOMP
2011
14 years 6 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...