1647 search results - page 16 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
140
click to vote
NIPS
2008
15 years 5 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
157
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
181
click to vote
OL
2011
14 years 11 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
223
click to vote
DCOSS
2011
Springer
14 years 4 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
136
click to vote
TOC
2008
15 years 4 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...