Complexity and approximation for traveling salesman problems with profits (Q2441781): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.tcs.2014.02.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970422603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP / 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: A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen / 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: A note on the prize collecting traveling salesman problem / 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: A constant-factor approximation algorithm for the \(k\)-MST problem / 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: Steiner Tree Problems With Profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:20, 7 July 2024

scientific article
Language Label Description Also known as
English
Complexity and approximation for traveling salesman problems with profits
scientific article

    Statements

    Complexity and approximation for traveling salesman problems with profits (English)
    0 references
    0 references
    28 March 2014
    0 references
    routing problem with profit
    0 references
    computational complexity
    0 references
    approximation algorithm
    0 references
    path
    0 references
    tree
    0 references
    cycle
    0 references

    Identifiers

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