Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6194534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems |
scientific article; zbMATH DE number 6194534 |
Statements
Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (English)
0 references
5 August 2013
0 references
ATSP
0 references
ATSPP
0 references
tour
0 references
stroll
0 references
\(k\)-Tour
0 references
\(k\)-Stroll
0 references
directed graphs
0 references
approximation algorithm
0 references
dynamic programming
0 references
LP rounding
0 references
0 references
0 references
0 references
0 references
0.9966990947723388
0 references
0.7999134063720703
0 references
0.7986826300621033
0 references
0.7864219546318054
0 references
0.7853912711143494
0 references
