Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57851400, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A simulated annealing approach to the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in Sports / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in sports: an annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round robin scheduling -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 5.875-approximation for the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the traveling tournament problem / rank
 
Normal rank

Latest revision as of 05:40, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for \(\mathrm{TTP(2)}\)
scientific article

    Statements