Polynomial time approximation schemes for dense instances...

Random Structures & Algorithms 2003 Vol. 23; Iss. 1

Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
23
Year:
2003
Language:
english
Pages:
19
DOI:
10.1002/rsa.10072
File:
PDF, 165 KB
english, 2003
Conversion to is in progress
Conversion to is failed