12519 search results - page 203 / 2504 » Approximation Problems Categories |
175
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
180
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
139
click to vote
SPIRE
2000
Springer
2000
Springer
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays
15 years 10 months ago
We consider the problem of defining and evaluating the distance between three
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
157
click to vote
AAIM
2006
Springer
16 years 14 days ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...