7129 search results - page 448 / 1426 » Approximation Algorithms for Treewidth |
218
Voted
OL
2011
15 years 1 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...
171
click to vote
TOC
2008
15 years 6 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 ...
165
click to vote
SIGECOM
2009
ACM
16 years 26 days ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
169
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
174
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...