Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem

DOI10.1016/j.endm.2006.08.057zbMath1301.05265OpenAlexW2017396332MaRDI QIDQ3439531

Yusuke Kuroki, Tomomi Matsui

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.08.057

zbMATH Keywords

approximation algorithmrandomized roundingsecond-order cone programmingmultidimensional assignment

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Randomized algorithms (68W20) Signed and weighted graphs (05C22)

Cites Work

• Statistical matching. A frequentist theory, practical applications, and alternative Bayesian approaches
• Geometric three-dimensional assignment problems
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs

This page was built for publication: Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem