New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/corr/abs-2005-10800
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-2005-10800
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Katarzyna_Paluch_0001
>
foaf:
homepage
<
https://arxiv.org/abs/2005.10800
>
dc:
identifier
DBLP journals/corr/abs-2005-10800
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/corr
>
rdfs:
label
New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Katarzyna_Paluch_0001
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-2005-10800/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/corr/abs-2005-10800
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-10800
>
rdfs:
seeAlso
<
https://arxiv.org/abs/2005.10800
>
dc:
title
New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
abs/2005.10800
(xsd:string)