EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2023.114202 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4386914427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin packing with cardinality constraints resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bin packing problem with item fragmentation: a worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for ordered vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactly solving packing problems with fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on load-balanced variants of the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of polynomial time approximation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism versus memory allocation in pipelined router forwarding engines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the cardinality constrained \(P \|C_{max}\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing problem with conflicts and item fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for packing splittable items with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results for a memory allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\kappa\)-partitioning problems for maximizing the minimum load / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing the Gap for Makespan Scheduling via Sparsification Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constrained bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / 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: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2023.114202 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:03, 30 December 2024

scientific article; zbMATH DE number 7755520
Language Label Description Also known as
English
EPTAS for the dual of splittable bin packing with cardinality constraint
scientific article; zbMATH DE number 7755520

    Statements

    EPTAS for the dual of splittable bin packing with cardinality constraint (English)
    0 references
    0 references
    0 references
    26 October 2023
    0 references
    approximation schemes
    0 references
    splittable bin packing
    0 references
    scheduling with cardinality constraint
    0 references

    Identifiers