A polynomial-time approximation scheme for the airplane refueling problem (Q2327962): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129813230, #quickstatements; #temporary_batch_1724872475876
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962812365 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.06353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive buffer management for latency sensitive packets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Approximation Algorithms for Maximum Separable Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3256187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for scheduling conflicting jobs with minsum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Techniques for Scheduling on a Machine with Varying Speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \((1-1/e)\)-approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / 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: Sum and Product in Dynamic Epistemic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pure Theory of Elevators / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129813230 / rank
 
Normal rank

Latest revision as of 20:16, 28 August 2024

scientific article
Language Label Description Also known as
English
A polynomial-time approximation scheme for the airplane refueling problem
scientific article

    Statements

    A polynomial-time approximation scheme for the airplane refueling problem (English)
    0 references
    0 references
    0 references
    8 October 2019
    0 references
    scheduling
    0 references
    approximation algorithms
    0 references
    PTAS
    0 references
    generalized assignment
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references