On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/networking/RetvariSB04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/networking/RetvariSB04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/G%E2%88%9A%C2%B0bor_R%E2%88%9A%C2%A9tv%E2%88%9A%C2%B0ri
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%E2%89%A5zsef_B%E2%88%9A%E2%89%A0r%E2%88%9A%E2%89%A5
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/R%E2%88%9A%E2%89%A5bert_Szab%E2%88%9A%E2%89%A5
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-24693-0%5F97
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-24693-0_97
>
dc:
identifier
DBLP conf/networking/RetvariSB04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-24693-0%5F97
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
rdfs:
label
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/G%E2%88%9A%C2%B0bor_R%E2%88%9A%C2%A9tv%E2%88%9A%C2%B0ri
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%E2%89%A5zsef_B%E2%88%9A%E2%89%A0r%E2%88%9A%E2%89%A5
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/R%E2%88%9A%E2%89%A5bert_Szab%E2%88%9A%E2%89%A5
>
swrc:
pages
1180-1191
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/networking/2004
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/networking/RetvariSB04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/networking/RetvariSB04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/networking/networking2004.html#RetvariSB04
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-24693-0_97
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/networking
>
dc:
subject
Traffic engineering, routing, linear programming, OSPF
(xsd:string)
dc:
title
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document