Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/mp/RamaswamyOC05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/mp/RamaswamyOC05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/James_B._Orlin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nilopal_Chakravarti
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ramkumar_Ramaswamy
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10107-004-0517-8
>
foaf:
homepage
<
https://doi.org/10.1007/s10107-004-0517-8
>
dc:
identifier
DBLP journals/mp/RamaswamyOC05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10107-004-0517-8
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/mp
>
rdfs:
label
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/James_B._Orlin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nilopal_Chakravarti
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ramkumar_Ramaswamy
>
swrc:
number
2
(xsd:string)
swrc:
pages
355-369
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/mp/RamaswamyOC05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/mp/RamaswamyOC05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/mp/mp102.html#RamaswamyOC05
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10107-004-0517-8
>
dc:
subject
Sensitivity analysis; Shortest path problem; Bottleneck shortest path; Maximum capacity path problem
(xsd:string)
dc:
title
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
102
(xsd:string)