Cite
HARVARD Citation
Unknown (2020) Complexity and approximation : combinatorial optimization problems and their approximability properties. [Online]. Cham : Springer. Available from: http://access.bl.uk/ark:/81055/vdc_100098880264.0x000001
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Unknown (2020) Complexity and approximation : combinatorial optimization problems and their approximability properties. [Online]. Cham : Springer. Available from: http://access.bl.uk/ark:/81055/vdc_100098880264.0x000001