EMNLP
2010
13 years 2 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
TOC
2008
13 years 4 months ago
2008
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
IPL
2007
13 years 4 months ago
2007
We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
4OR
2008
13 years 4 months ago
2008
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
IPCO
2004
13 years 6 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
UAI
2008
13 years 6 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
NIPS
2007
13 years 6 months ago
2007
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
IPCO
2010
13 years 6 months ago
2010
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K