On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jco/KlerkPW04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jco/KlerkPW04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dmitrii_V._Pasechnik
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Etienne_de_Klerk
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joost_P._Warners
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1023%2FB%3AJOCO.0000038911.67280.3f
>
foaf:
homepage
<
https://doi.org/10.1023/B:JOCO.0000038911.67280.3f
>
dc:
identifier
DBLP journals/jco/KlerkPW04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1023%2FB%3AJOCO.0000038911.67280.3f
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jco
>
rdfs:
label
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dmitrii_V._Pasechnik
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Etienne_de_Klerk
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joost_P._Warners
>
swrc:
number
3
(xsd:string)
swrc:
pages
267-294
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jco/KlerkPW04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jco/KlerkPW04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jco/jco8.html#KlerkPW04
>
rdfs:
seeAlso
<
https://doi.org/10.1023/B:JOCO.0000038911.67280.3f
>
dc:
subject
graph colouring; approximation algorithms; satisfiability; semidefiniteprogramming; Lovász -function; MAX-k-CUT
(xsd:string)
dc:
title
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)