The A priori traveling repairman problem (Q722527): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-017-0351-z / rank
Normal rank
 
Property / author
 
Property / author: R. A. Sitters / rank
Normal rank
 
Property / author
 
Property / author: R. A. Sitters / 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-017-0351-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2741682221 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59515176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sampling algorithms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected facility location via random facility sampling and core detouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum latency problem / 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: Improved Lower Bounds for the Universal and a priori TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the universal and a priori TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Under Uncertainty: The a priori Traveling Repairman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-017-0351-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:02, 10 December 2024

scientific article
Language Label Description Also known as
English
The A priori traveling repairman problem
scientific article

    Statements

    The A priori traveling repairman problem (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    a priori optimization
    0 references
    approximation algorithms
    0 references
    traveling repairman problem
    0 references

    Identifiers