Sciweavers

356 search results - page 16 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
IPCO
2004
142views Optimization» more  IPCO 2004»
13 years 9 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
JMLR
2010
106views more  JMLR 2010»
13 years 2 months ago
Improving posterior marginal approximations in latent Gaussian models
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
Botond Cseke, Tom Heskes
HIS
2008
13 years 9 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
13 years 7 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
COCOON
2005
Springer
14 years 1 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu