How to whack moles (Q2503357): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57399775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728857 / 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: Q2768123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online TSP Against Fair Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2746971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for the dynamic traveling repair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: Maximizing job completions online / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank

Latest revision as of 20:24, 24 June 2024

scientific article
Language Label Description Also known as
English
How to whack moles
scientific article

    Statements

    How to whack moles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    NP-hardness
    0 references
    dynamic programming
    0 references
    0 references
    0 references