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
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: MohammadHossein Bateni / rank
Normal rank
 
Property / author
 
Property / author: MohammadHossein Bateni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9610-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998327496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for deadline-TSP and vehicle routing with time-windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Orienteering and Discounted-Reward TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Integrality Ratio for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:52, 6 July 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