Hardness of the undirected edge-disjoint paths problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stoc/AndrewsZ05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AndrewsZ05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lisa_Zhang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Matthew_Andrews
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1060590.1060632
>
foaf:
homepage
<
https://doi.org/10.1145/1060590.1060632
>
dc:
identifier
DBLP conf/stoc/AndrewsZ05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1060590.1060632
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
rdfs:
label
Hardness of the undirected edge-disjoint paths problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lisa_Zhang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Matthew_Andrews
>
swrc:
pages
276-283
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2005
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stoc/AndrewsZ05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stoc/AndrewsZ05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stoc/stoc2005.html#AndrewsZ05
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1060590.1060632
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stoc
>
dc:
subject
edge-disjoint paths, hardness of approximation, undirected graphs
(xsd:string)
dc:
title
Hardness of the undirected edge-disjoint paths problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document