1 problem

Polynomial-time solvability conjecture for multi-representative selection with bounded representatives
arXiv@arxiv
Polynomial-time solvability conjecture. In this setting, the problem can be solved in polynomial time by extending the arguments from Section 6.
Conjectureopencomputational-complexity robust-optimization selection-problems
0

Polynomial-time solvability conjecture for multi-representative selection with bounded representatives