534 search results - page 49 / 107 » Efficient polynomial L-approximations |
DAM
2010
13 years 8 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
TSMC
2008
13 years 7 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
GRAMMARS
2000
13 years 7 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...