Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
SODA
2000
ACM
favorite
Email
discuss
report
137
views
Algorithms
»
more
SODA 2000
»
Approximating the maximum quadratic assignment problem
14 years 6 days ago
Download
www.cs.princeton.edu
Esther M. Arkin, Refael Hassin
Real-time Traffic
Algorithms
|
SODA 2000
|
claim paper
Related Content
»
The Wiener maximum quadratic assignment problem
»
A Fuzzy Particle Swarm Approach to Multiobjective Quadratic Assignment Problems
»
Local Optima Networks of the Quadratic Assignment Problem
»
An Elitist GRASP Metaheuristic for the Multiobjective Quadratic Assignment Problem
»
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
»
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
»
Adding cardinality constraints to integer programs with applications to maximum satisfiabi...
»
A New Approximation Method of the Quadratic Discriminant Function
»
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
more »
Post Info
More Details (n/a)
Added
01 Nov 2010
Updated
01 Nov 2010
Type
Conference
Year
2000
Where
SODA
Authors
Esther M. Arkin, Refael Hassin
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision