Approximation Algorithms for Minimum Size 2-Connectivity Problems.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stacs/KrystaK01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stacs/KrystaK01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Piotr_Krysta
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/V._S._Anil_Kumar_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-44693-1%5F38
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-44693-1_38
>
dc:
identifier
DBLP conf/stacs/KrystaK01
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-44693-1%5F38
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
rdfs:
label
Approximation Algorithms for Minimum Size 2-Connectivity Problems.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Piotr_Krysta
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/V._S._Anil_Kumar_0001
>
swrc:
pages
431-442
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stacs/2001
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stacs/KrystaK01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stacs/KrystaK01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stacs/stacs2001.html#KrystaK01
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-44693-1_38
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stacs
>
dc:
title
Approximation Algorithms for Minimum Size 2-Connectivity Problems.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document