Faster algorithms for orienteering and \(k\)-TSP (Q2124233): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213005497 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2002.07727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem: II. Polyhedral results / 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: Approximation Algorithms for Orienteering and Discounted-Reward TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean Orienteering Problem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for orienteering and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact, provably-good LPs for orienteering and regret-bounded vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running Errands in Time: Approximation Algorithms for Stochastic Orienteering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank

Latest revision as of 17:16, 28 July 2024

scientific article
Language Label Description Also known as
English
Faster algorithms for orienteering and \(k\)-TSP
scientific article

    Statements

    Faster algorithms for orienteering and \(k\)-TSP (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2022
    0 references
    orienteering
    0 references
    \(k\)-TSP
    0 references
    plane sweep algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references