Sciweavers

3875 search results - page 85 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
STOC
2002
ACM
84views Algorithms» more  STOC 2002»
14 years 9 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...
IPL
2000
146views more  IPL 2000»
13 years 8 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
EOR
2007
93views more  EOR 2007»
13 years 8 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 9 months ago
An Algorithm to Extract Rules from Artificial Neural Networks for Medical Diagnosis Problems
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
S. M. Kamruzzaman, Md. Monirul Islam
SIAMSC
2008
179views more  SIAMSC 2008»
13 years 8 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros