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