Optimal covering tours with turn costs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/soda/ArkinBDFMS01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/soda/ArkinBDFMS01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Erik_D._Demaine
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Esther_M._Arkin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_S._B._Mitchell
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_A._Bender
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%B0ndor_P._Fekete
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Saurabh_Sethia
>
foaf:
homepage
<
http://dl.acm.org/citation.cfm?id=365411.365430
>
dc:
identifier
DBLP conf/soda/ArkinBDFMS01
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
rdfs:
label
Optimal covering tours with turn costs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Erik_D._Demaine
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Esther_M._Arkin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_S._B._Mitchell
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_A._Bender
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%B0ndor_P._Fekete
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Saurabh_Sethia
>
swrc:
pages
138-147
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/soda/2001
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/soda/ArkinBDFMS01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/soda/ArkinBDFMS01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/soda/soda2001.html#ArkinBDFMS01
>
rdfs:
seeAlso
<
http://dl.acm.org/citation.cfm?id=365411.365430
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/soda
>
dc:
subject
m-guillotine subdivisions, NC machining, NP-completeness, approximation algorithms, covering, lawn mowing, manufacturing, milling, polynomial-time approximation scheme (PTAS), traveling salesman problem (TSP), turn costs
(xsd:string)
dc:
title
Optimal covering tours with turn costs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document