Approximating min sum set cover
From MaRDI portal
Recommendations
Cited in
(47)- Approximation and complexity of multi-target graph search and the Canadian traveler problem
- Approximating optimal binary decision trees
- Minimum sum set coloring of trees and line graphs of trees
- Tree optimization based heuristics and metaheuristics in network construction problems
- Minimum sum coloring of \(P_{4}\)-sparse graphs
- Maximum subset intersection
- A General Framework for Approximating Min Sum Ordering Problems
- Chromatic Edge Strength of Some Multigraphs
- Parameterized algorithms for minimum sum vertex cover
- Min-sum bin packing
- A note on the generalized min-sum set cover problem
- Assortment optimization over time
- A closest vector problem arising in radiation therapy planning
- Network construction/restoration problems: cycles and complexity
- Preemptive and non-preemptive generalized min sum set cover
- On the distributed complexity of the semi-matching problem
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Tight approximation algorithms for ordered covering
- An improved deterministic algorithm for the online min-sum set cover problem
- Improved analysis of two algorithms for min-weighted sum bin packing
- Improved approximations for min sum vertex cover and generalized min sum set cover
- Preemptive and non-preemptive generalized min sum set cover
- Some results on approximability of minimum sum vertex cover
- Minimum sum edge colorings of multicycles
- Independent sets in bounded-degree hypergraphs
- Minimum entropy combinatorial optimization problems
- Exact and Approximation Algorithms for the Expanding Search Problem
- Precedence-Constrained Min Sum Set Cover
- Minimum entropy combinatorial optimization problems
- On min sum vertex cover and generalized min sum set cover
- Tight results on minimum entropy set cover
- On competitive recommendations
- scientific article; zbMATH DE number 1947050 (Why is no real title available?)
- Weighted sum coloring in batch scheduling of conflicting jobs
- scientific article; zbMATH DE number 784428 (Why is no real title available?)
- Minimum Weighted Sum Bin Packing
- A constant factor approximation algorithm for generalized MIN-sum set cover
- Ignorant vs. anonymous recommendations
- Algorithms – ESA 2005
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
- Minimum entropy orientations
- Hardness and approximation of submodular minimum linear ordering problems
- Decision-theoretic troubleshooting: hardness of approximation
- Ranking with submodular functions on a budget
- On the inapproximability of maximum intersection problems
- Some algorithmic results for [2]-sumset covers
This page was built for publication: Approximating min sum set cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884768)
