4894 search results - page 11 / 979 » The Guarding Problem - Complexity and Approximation |
75
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
130
Voted
IPCO
2004
15 years 2 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
IPL
2007
15 years 22 days ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
64
Voted
ADCM
2000
15 years 20 days ago
2000
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...