Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem

DOI10.1016/J.ENDM.2006.08.057MaRDI QIDQ3439531zbMATH OpenOpenAlexFDO

Authors 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 algorithmmultidimensional assignmentrandomized roundingsecond-order cone programming

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

• Randomized algorithms for the separation of point sets and for solving quadratic programs
• Random assignment problems on 2d manifolds
• scientific article; zbMATH DE number 1857642 (Why is no real title available?)
• scientific article; zbMATH DE number 7525513 (Why is no real title available?)
• Efficient algorithms for three‐dimensional axial and planar random assignment problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439531)