A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.tcs.2007.02.056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000850616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the single-source unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and simple approximation schemes for generalized flow. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria for scheduling on restricted parallel links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Algorithms for the Generalized Circulation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Single-Source Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the unrelated parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum flows in general communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for the Generalized Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving time bounds on maximum generalised flow computations by contracting the network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / 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: Scheduling tasks on unrelated machines: large neighborhood improvement procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Max Flows with Gains and Pure Min-Cost Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality-Based Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank

Latest revision as of 11:13, 26 June 2024

scientific article
Language Label Description Also known as
English
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
scientific article

    Statements

    A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    scheduling
    0 references
    unrelated parallel machines
    0 references
    approximation algorithms
    0 references
    unsplittable network flow
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers