Showing posts with label Approximating. Show all posts
Showing posts with label Approximating. Show all posts

Monday, 22 July 2013

On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. (arXiv:1307.5090v1 [cs.CC])

Subjects: Computational Complexity (cs.CC) Sorry, I could not read the content fromt this page.

View the original article here

Optimally Approximating the Lifetime of Wireless Sensor Networks. (arXiv:1307.5230v1 [cs.NI])

Comments: 22 pages, 7 figures Sorry, I could not read the content fromt this page.

View the original article here