Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 19:15, 2 February 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
scientific article

    Statements

    Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (English)
    0 references
    0 references
    0 references
    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

    Identifiers