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

Chlebík, Miroslav and Chlebíková, Janka (2005) Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. In: Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada.

Full text not available from this repository.
Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Mathematical and Physical Sciences > Mathematics
Depositing User: Miroslav Chlebik
Date Deposited: 06 Feb 2012 20:01
Last Modified: 11 Apr 2012 11:57
URI: http://sro.sussex.ac.uk/id/eprint/23557
📧 Request an update