https://dblp.org/rdf/schema#authoredBy
|
https://dblp.org/pid/29/6291 +
, https://dblp.org/pid/g/MichelXGoemans +
, https://dblp.org/pid/67/2454 +
, https://dblp.org/pid/61/395 +
, https://dblp.org/pid/28/4017 +
|
https://dblp.org/rdf/schema#bibtexType
|
http://purl.org/net/nknouf/ns/bibtex#Article +
|
https://dblp.org/rdf/schema#createdBy
|
https://dblp.org/pid/29/6291 +
, https://dblp.org/pid/g/MichelXGoemans +
, https://dblp.org/pid/67/2454 +
, https://dblp.org/pid/61/395 +
, https://dblp.org/pid/28/4017 +
|
https://dblp.org/rdf/schema#documentPage
|
https://doi.org/10.1287/OPRE.2017.1603 +
|
https://dblp.org/rdf/schema#doi
|
https://doi.org/10.1287/OPRE.2017.1603 +
|
https://dblp.org/rdf/schema#listedOnTocPage
|
https://dblp.org/db/journals/ior/ior65 +
|
https://dblp.org/rdf/schema#numberOfCreators
|
5
|
https://dblp.org/rdf/schema#pagination
|
1043-1061
|
https://dblp.org/rdf/schema#primaryDocumentPage
|
https://doi.org/10.1287/OPRE.2017.1603 +
|
https://dblp.org/rdf/schema#publishedIn
|
Oper. Res.
|
https://dblp.org/rdf/schema#publishedInJournal
|
Oper. Res.
|
https://dblp.org/rdf/schema#publishedInJournalVolume
|
65
|
https://dblp.org/rdf/schema#publishedInJournalVolumeIssue
|
4
|
https://dblp.org/rdf/schema#publishedInStream
|
https://dblp.org/streams/journals/ior +
|
https://dblp.org/rdf/schema#title
|
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
|
https://dblp.org/rdf/schema#wikidata
|
http://www.wikidata.org/entity/Q94086899 +
|
https://dblp.org/rdf/schema#yearOfPublication
|
2017
|
owl:sameAs |
https://doi.org/10.1287/OPRE.2017.1603 +
, http://dx.doi.org/10.1287/OPRE.2017.1603 +
, http://www.wikidata.org/entity/Q94086899 +
|
rdf:type |
https://dblp.org/rdf/schema#Publication +
, https://dblp.org/rdf/schema#Article +
|
rdfs:label |
Arash Asadpour et al.: An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem. (2017)
|