![NP-complete problems / Independent set / Polygon / Connectivity / Distance / Tree / Matching / Graph / Shortest path problem / Theoretical computer science / Graph theory / Mathematics NP-complete problems / Independent set / Polygon / Connectivity / Distance / Tree / Matching / Graph / Shortest path problem / Theoretical computer science / Graph theory / Mathematics](https://www.pdfsearch.io/img/ecefd1b9d629b2f7be12be444ae4c9c7.jpg)
| Document Date: 2014-05-22 11:07:19 Open Document File Size: 539,18 KBShare Result on Facebook
City Berlin / Rome / Sassari / / Company Aquila / / Country Germany / Switzerland / Italy / / / IndustryTerm furthest-site / polynomial-time algorithm / breadth-first search trees / obstacle-free ad-hoc network / controlled devices / approximation algorithm / limited-sensing robotic devices / sensor networking / approximate solution / / Organization Italian Ministry of Education / Institut f¨ / / Person Tor Vergata / Con-Max / Peter Widmayer Guido Proietti / Guido Proietti / Max Sum / Luciano Gual / / Position Prime Minister / General / pm / qm } / / Technology approximation algorithm / polynomial-time algorithm / /
SocialTag |