Deadline TSP (Q5925174): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128880753, #quickstatements; #temporary_batch_1726362513169
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.11.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205315587 / 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: The parameterized approximability of TSP with deadlines / 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: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the traveling repairman and speeding deliveryman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128880753 / rank
 
Normal rank

Latest revision as of 02:32, 15 September 2024

scientific article; zbMATH DE number 7056088
Language Label Description Also known as
English
Deadline TSP
scientific article; zbMATH DE number 7056088

    Statements

    Identifiers