Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/HalldorssonR97
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/HalldorssonR97
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jaikumar_Radhakrishnan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Magn%E2%88%9A%C4%BCs_M._Halld%E2%88%9A%E2%89%A5rsson
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2FBF02523693
>
foaf:
homepage
<
https://doi.org/10.1007/BF02523693
>
dc:
identifier
DBLP journals/algorithmica/HalldorssonR97
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2FBF02523693
(xsd:string)
dcterms:
issued
1997
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jaikumar_Radhakrishnan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Magn%E2%88%9A%C4%BCs_M._Halld%E2%88%9A%E2%89%A5rsson
>
swrc:
number
1
(xsd:string)
swrc:
pages
145-163
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/HalldorssonR97/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/HalldorssonR97
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica18.html#HalldorssonR97
>
rdfs:
seeAlso
<
https://doi.org/10.1007/BF02523693
>
dc:
title
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
18
(xsd:string)