Precedence-Constrained Min Sum Set Cover

DOI10.4230/LIPICS.ISAAC.2017.55zbMATH Open1457.68222OpenAlexW2777161377MaRDI QIDQ5136276FDOQ5136276

Authors: Jessica McClintock, Julián Mestre, Anthony Wirth 

Publication date: 25 November 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8264/pdf/LIPIcs-ISAAC-2017-55.pdf/

Recommendations

• Preemptive and non-preemptive generalized min sum set cover
• Preemptive and non-preemptive generalized min sum set cover
• Precedence-constrained scheduling and min-sum set cover (extended Abstract)
• Precedence-constrained covering problems with multiplicity constraints
• Precedence-constrained covering problems with multiplicity constraints
• scientific article; zbMATH DE number 1947050
• Approximating min sum set cover
• Submodular function minimization with submodular set covering constraints and precedence constraints
• Primal-dual algorithms for precedence constrained covering problems
• Primal-dual algorithms for precedence constrained covering problems

zbMATH Keywords

precedence constrainedplanted dense subgraphmin sum set cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Scheduling Tasks with AND/OR Precedence Constraints
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• On the hardness of approximating label-cover
• Approximating min sum set cover
• Multiple intents re-ranking
• A constant factor approximation algorithm for generalized MIN-sum set cover
• Partially ordered knapsack and applications to scheduling
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Database Theory - ICDT 2005
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
• The knapsack problem with neighbour constraints
• Intractability of assembly sequencing: unit disks in the plane
• On approximating target set selection
• Approximation and Online Algorithms

Cited In (2)

• A General Framework for Approximating Min Sum Ordering Problems
• On min sum vertex cover and generalized min sum set cover

This page was built for publication: Precedence-Constrained Min Sum Set Cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136276)