Sciweavers

497 search results - page 1 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
ALGOSENSORS
2008
Springer
13 years 6 months ago
Tight Local Approximation Results for Max-Min Linear Programs
Patrik Floréen, Marja Hassinen, Petteri Kas...
ESANN
2006
13 years 6 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
ANOR
2011
117views more  ANOR 2011»
12 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
SPAA
2009
ACM
14 years 5 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
IPPS
2008
IEEE
13 years 11 months ago
Approximating max-min linear programs with local algorithms
Patrik Floréen, Petteri Kaski, Topi Musto, ...