114 search results - page 16 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
107
click to vote
STOC
2003
ACM
16 years 20 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
103
click to vote
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
121
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
111
click to vote
TASE
2010
IEEE
14 years 7 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
STOC
2004
ACM
16 years 20 days ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...