![Hypergraph / Combinatorics / Vertex cover / Graph / Incidence matrix / Planar graph / Path decomposition / Line graph / Graph theory / Mathematics / NP-complete problems Hypergraph / Combinatorics / Vertex cover / Graph / Incidence matrix / Planar graph / Path decomposition / Line graph / Graph theory / Mathematics / NP-complete problems](https://www.pdfsearch.io/img/9d3cc279c3a96a7206c83fe2295c2bda.jpg)
| Document Date: 2011-08-06 04:11:12 Open Document File Size: 345,79 KBShare Result on Facebook
City Providence / Amsterdam / Montr´eal / New York / / Company John Wiley & Sons Inc. / Cambridge University Press / Vertex / / Country United States / Netherlands / Canada / / / Facility Art gallery / The City University of New York / / IndustryTerm mobile ad-hoc networks / polynomial-time approximation algorithm / naive deterministic algorithm / approximation algorithm / greedy algorithm / factor approximation algorithm / concrete algorithm / wireless sensor networks / / Organization Cambridge University / Graduate Center / The City University of New York / / Person Alon Efrat / Nabil Mustafa / Boris Aronov / / Position author / representative / head / / ProvinceOrState Rhode Island / New York / / PublishedMedium Theory of Computing / / Technology polynomial-time approximation algorithm / specific algorithm / RAM / randomized algorithm / concrete algorithm / 4 Algorithm / approximation algorithm / greedy algorithm / Approximation Algorithms / Visibility Algorithms / factor approximation algorithm / naive deterministic algorithm / / URL http /
SocialTag |