Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4252268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum Multicoloring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems with Hard Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for vertex cover with hard capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast approximation algorithm for the multicovering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Set Multicover and Multiset Multicover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set multi-covering via inclusion-exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for covering/packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating covering integer programs with multiplicity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling orders for multiple product types with due date related objectives / 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: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees for Packing and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank

Latest revision as of 22:06, 2 July 2024

scientific article
Language Label Description Also known as
English
Dynamic programming based algorithms for set multicover and multiset multicover problems
scientific article

    Statements

    Dynamic programming based algorithms for set multicover and multiset multicover problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2010
    0 references
    0 references
    set multicover
    0 references
    multiset multicover
    0 references
    inclusion-exclusion
    0 references
    dynamic programming
    0 references
    algorithm
    0 references
    0 references