Maximizing Polynomials Subject to Assignment Constraints
From MaRDI portal
Publication:3012829
DOI10.1007/978-3-642-22006-7_43zbMath1334.68302OpenAlexW2102514177MaRDI QIDQ3012829
M. I. Sviridenko, Konstantin Makarychev
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_43
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Heuristics for biquadratic assignment problems and their computational comparison
- Real-time dispatch of trams in storage yards
- Approximating the maximum quadratic assignment problem
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- Simple linear time approximation algorithm for betweenness
- The Quadratic Assignment Problem
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
- On the Maximum Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
- A Geometric Approach to Betweenness
- Efficient probabilistically checkable proofs and applications to approximations
This page was built for publication: Maximizing Polynomials Subject to Assignment Constraints