The shortest route cut and fill problem in linear topological structure.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/sac/GuoLLW05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/sac/GuoLLW05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andrew_Lim_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Fan_Wang_0003
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Songshan_Guo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Weixing_Li
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1066677.1066772
>
foaf:
homepage
<
https://doi.org/10.1145/1066677.1066772
>
dc:
identifier
DBLP conf/sac/GuoLLW05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1066677.1066772
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
rdfs:
label
The shortest route cut and fill problem in linear topological structure.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andrew_Lim_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Fan_Wang_0003
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Songshan_Guo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Weixing_Li
>
swrc:
pages
409-410
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/sac/2005
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/sac/GuoLLW05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/sac/GuoLLW05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/sac/sac2005.html#GuoLLW05
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1066677.1066772
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/sac
>
dc:
subject
cut and fill, optimization
(xsd:string)
dc:
title
The shortest route cut and fill problem in linear topological structure.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document