Change search
ReferencesLink to record
Permanent link

Direct link
Inapproximability of vertex cover and independent set in bounded degree graphs
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-8217-0158
2011 (English)In: Theory of Computing, ISSN 1557-2862, Vol. 7, 27-43 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2011. Vol. 7, 27-43 p.
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:kth:diva-154804DOI: 10.4086/toc.2011.v007a003OAI: diva2:758622

QC 20150202

Available from: 2014-10-27 Created: 2014-10-27 Last updated: 2015-02-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textTheory of computing

Search in DiVA

By author/editor
Austrin, Per
By organisation
Theoretical Computer Science, TCS
In the same journal
Theory of Computing
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 47 hits
ReferencesLink to record
Permanent link

Direct link