The Guarding Problem - Complexity and Approximation.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/iwoca/ReddyKR09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/iwoca/ReddyKR09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/C._Pandu_Rangan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/D._Sai_Krishna
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/T._V._Thirumala_Reddy
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-10217-2%5F45
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-10217-2_45
>
dc:
identifier
DBLP conf/iwoca/ReddyKR09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-10217-2%5F45
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
The Guarding Problem - Complexity and Approximation.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/C._Pandu_Rangan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/D._Sai_Krishna
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/T._V._Thirumala_Reddy
>
swrc:
pages
460-470
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/iwoca/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/iwoca/ReddyKR09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/iwoca/ReddyKR09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/iwoca/iwoca2009.html#ReddyKR09
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-10217-2_45
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/iwoca
>
dc:
subject
Approximation Algorithms; PSPACE-complete; QBF (Quantified Boolean Formula); QSAT (Quantified Satisfiability)
(xsd:string)
dc:
title
The Guarding Problem - Complexity and Approximation.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document