Sciweavers

3875 search results - page 12 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
EOR
2006
120views more  EOR 2006»
13 years 7 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
JCO
2007
128views more  JCO 2007»
13 years 7 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
FSTTCS
2006
Springer
13 years 11 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
SIAMCOMP
2008
123views more  SIAMCOMP 2008»
13 years 7 months ago
Approximation Algorithms for Biclustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
Lusheng Wang, Yu Lin, Xiaowen Liu
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
13 years 11 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...