Matrix columns allocation problems

DOI10.1016/j.tcs.2009.02.015zbMath1166.68004OpenAlexW1982015000MaRDI QIDQ1019735

Eldad Chai, Boaz Ben-Moshe, Eran Omri, Itzik Kitroser, Amos Beimel, Paz Carmi, Yehuda Ben-Shimol

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.015

zbMATH Keywords

NP-completenessinapproximabilityallocation problems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation algorithm for the generalized assignment problem
• P-Complete Approximation Problems
• Approximation and Online Algorithms