Approximability and exact resolution of the multidimensional binary vector assignment problem

DOI10.1007/S10878-018-0276-8zbMath1410.90174OpenAlexW2796157151MaRDI QIDQ1631661

Rodolphe Giroudeau, Guillerme Duvillié, Marin Bougeret

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/307765/3/JOCO_2017_approx_and_exact_resolution_bMVA.pdf

zbMATH Keywords

dynamic programmingapproximation algorithminapproximabilityUGC

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Some APX-completeness results for cubic graphs
• Multi-dimensional vector assignment problems
• Approximation Algorithms for the Wafer to Wafer Integration Problem
• On the Complexity of Wafer-to-Wafer Integration
• Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

This page was built for publication: Approximability and exact resolution of the multidimensional binary vector assignment problem