Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.
Resource URI: http://dblp.l3s.de/d2r/resource/publications/journals/combinatorica/AndrewsCGKTZ10
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/combinatorica/AndrewsCGKTZ10
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Julia_Chuzhoy
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Kunal_Talwar
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Lisa_Zhang
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Matthew_Andrews
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Sanjeev_Khanna
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Venkatesan_Guruswami
>
foaf:
homepage
<
http://dx.doi.org/10.1007%2Fs00493-010-2455-9
>
foaf:
homepage
<
http://dx.doi.org/10.1007/s00493-010-2455-9
>
dc:
identifier
DBLP journals/combinatorica/AndrewsCGKTZ10
(xsd:string)
dc:
identifier
DOI 10.1007%2Fs00493-010-2455-9
(xsd:string)
dcterms:
issued
2010
(xsd:gYear)
swrc:
journal
<
http://dblp.l3s.de/d2r/resource/journals/combinatorica
>
rdfs:
label
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.
(xsd:string)
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Julia_Chuzhoy
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Kunal_Talwar
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Lisa_Zhang
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Matthew_Andrews
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Sanjeev_Khanna
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Venkatesan_Guruswami
>
swrc:
number
5
(xsd:string)
swrc:
pages
485-520
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/combinatorica/AndrewsCGKTZ10/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/combinatorica/AndrewsCGKTZ10
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/combinatorica/combinatorica30.html#AndrewsCGKTZ10
>
rdfs:
seeAlso
<
http://dx.doi.org/10.1007/s00493-010-2455-9
>
dc:
title
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
30
(xsd:string)