4843 search results - page 123 / 969 » The Shortcut Problem - Complexity and Approximation |
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
89
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
CDC
2009
IEEE
15 years 2 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....
83
Voted
CIAC
2006
Springer
15 years 1 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...
SPIRE
2000
Springer
2000
Springer
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays
15 years 1 months ago
We consider the problem of defining and evaluating the distance between three