Sciweavers

4377 search results - page 94 / 876
» Mass problems and randomness
Sort
View
WG
2005
Springer
15 years 11 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
DAM
2010
120views more  DAM 2010»
15 years 5 months ago
A new approximation algorithm for the multilevel facility location problem
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 ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
JCSS
2006
89views more  JCSS 2006»
15 years 5 months ago
Ramsey-type theorems for metric spaces with applications to online problems
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Yair Bartal, Béla Bollobás, Manor Me...
AMC
2004
79views more  AMC 2004»
15 years 5 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
COR
2004
127views more  COR 2004»
15 years 5 months ago
Towards the real time solution of strike force asset allocation problems
The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximiz...
Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd