Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Flow algorithms for two pipelined filter ordering problems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Decision trees for entity identification: approximation algorithms and hardness results
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Foundations and Trends in Databases
A combinatorial allocation mechanism with penalties for banner advertising
Proceedings of the 17th international conference on World Wide Web
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locating dependence structures using search-based slicing
Information and Software Technology
Approximating Optimal Binary Decision Trees
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximating Decision Trees with Multiway Branches
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Combining multiple heuristics online
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Index interactions in physical design tuning: modeling, analysis, and applications
Proceedings of the VLDB Endowment
Minimum weighted sum bin packing
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics
The security of modern password expiration: an algorithmic framework and empirical analysis
Proceedings of the 17th ACM conference on Computer and communications security
A constant factor approximation algorithm for generalized min-sum set cover
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Decision trees for entity identification: Approximation algorithms and hardness results
ACM Transactions on Algorithms (TALG)
Information Processing Letters
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A closest vector problem arising in radiation therapy planning
Journal of Combinatorial Optimization
An approximation algorithm for the minimum latency set cover problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight results on minimum entropy set cover
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Weighted sum coloring in batch scheduling of conflicting jobs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Adaptive submodularity: theory and applications in active learning and stochastic optimization
Journal of Artificial Intelligence Research
Operations Research Letters
On the inapproximability of maximum intersection problems
Information Processing Letters
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms (TALG)
Minimum latency submodular cover
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Distributed 2-approximation algorithm for the semi-matching problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
On the security of picture gesture authentication
SEC'13 Proceedings of the 22nd USENIX conference on Security
Decision-theoretic troubleshooting: Hardness of approximation
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
The input to the min sum set cover problem is a collection of n sets that jointly cover m elements. The output is a linear order on the sets, namely, in every time step from 1 to n exactly one set is chosen. For every element, this induces a first time step by which it is covered. The objective is to find a linear arrangement of the sets that minimizes the sum of these first time steps over all elements. We show that a greedy algorithm approximates min sum set cover within a ratio of 4. This result was implicit in work of Bar-Noy, Bellare, Halldorsson, Shachnai, and Tamir (1998) on chromatic sums, but we present a simpler proof. We also show that for every ε 0, achieving an approximation ratio of 4 – ε is NP-hard. For the min sum vertex cover version of the problem (which comes up as a heuristic for speeding up solvers of semidefinite programs) we show that it can be approximated within a ratio of 2, and is NP-hard to approximate within some constant ρ 1.