Some APX-completeness results for cubic graphs

By P. Alimonti, Viggo Kann. Theoretical Computer Science, 2000

356 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/fdb92a8290753a232ae05b5a69c343d2550d1102

Citations in the corpus

• ( Please , provide the manuscript number ! ) Capacity Constrained Assortment Optimization under the Markov Chain based Choice Model (2015, unknown): “In this section, we present our hardness of approximation results for the constrained assortment optimization problem under the Markov chain choice model.”