Improved bounds for open online dial-a-ride on the line (Q2701389): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-022-01061-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: DARCLASS / 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-022-01061-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2954136843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Online Algorithm for the Traveling Repairperson Problem on a Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of the online dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Online TSP on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online TSP Against Fair Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided Complexity Classification of Dial-a-Ride Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line single-server dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a vehicle of capacity greater than one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: News from the online traveling repairman. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line dial-a-ride problems under a restricted information model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications in Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-022-01061-4 / rank
 
Normal rank

Latest revision as of 20:56, 19 December 2024

scientific article
Language Label Description Also known as
English
Improved bounds for open online dial-a-ride on the line
scientific article

    Statements

    Improved bounds for open online dial-a-ride on the line (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    dial-a-ride on the line
    0 references
    elevator problem
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    smartstart
    0 references
    competitive ratio
    0 references

    Identifiers