50 search results - page 8 / 10 » Proof Verification and Hardness of Approximation Problems |
STOC
2003
ACM
14 years 8 months 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...
ATVA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
IJCAI
2003
13 years 10 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...