676 search results - page 36 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
127
click to vote
TSP
2008
15 years 1 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
125
click to vote
CDC
2009
IEEE
15 years 6 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....
117
click to vote
UAI
1998
15 years 3 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
147
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
116
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...