An Approximation Scheme for Planar Graph TSP.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/GrigniKP95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/GrigniKP95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Christos_H._Papadimitriou
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Elias_Koutsoupias
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michelangelo_Grigni
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492665
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1995.492665
>
dc:
identifier
DBLP conf/focs/GrigniKP95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1995.492665
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
An Approximation Scheme for Planar Graph TSP.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Christos_H._Papadimitriou
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Elias_Koutsoupias
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michelangelo_Grigni
>
swrc:
pages
640-645
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/GrigniKP95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/GrigniKP95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs95.html#GrigniKP95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1995.492665
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
travelling salesman problems; operations research; computational complexity; approximation theory; graph theory; traveling salesman problem; distance metric; polynomial-time; approximation scheme; planar unweighted graph; shortest-path metric
(xsd:string)
dc:
title
An Approximation Scheme for Planar Graph TSP.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document