Preemptive and non-preemptive generalized min sum set cover
DOI10.1007/S10107-013-0651-2zbMATH Open1358.68321OpenAlexW2160834479MaRDI QIDQ2248757FDOQ2248757
Authors: Sungjin Im, Ruben van der Zwaan, Maxim Sviridenko 
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3399/
Recommendations
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Geometric algorithms and combinatorial optimization.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Title not available (Why is that?)
- On chromatic sums and distributed resource allocation
- Approximating min sum set cover
- A note on the generalized min-sum set cover problem
- Multiple intents re-ranking
- Title not available (Why is that?)
- Optimal Long Code Test with One Free Bit
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- On the approximability of average completion time scheduling under precedence constraints.
- A matched approximation bound for the sum of a greedy coloring
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Preemptive and non-preemptive generalized min sum set cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248757)
