Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes

Miroslav Chlebik, Janka Chlebikova

Research output: Chapter in Book/Report/Conference proceedingConference contribution

64 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes'. Together they form a unique fingerprint.

Mathematics