A General Framework for Approximating Min Sum Ordering Problems

We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of min sum set cover, several scheduling and search problems, and problems in Boolean function evaluation. We define a new problem, called the min sum ordering problem (MSOP), which generalizes all these problems using a cost and a weight function defined on subsets of a finite set. Assuming a polynomial time α-approximation algorithm for the problem of finding a subset whose ratio of weight to cost is maximal, we show that under very minimal assumptions, there is a polynomial time [Formula: see text]-approximation algorithm for MSOP. This approximation result generalizes a proof technique used for several distinct problems in the literature. We apply this to obtain a number of new approximation results. Summary of Contribution: This paper provides a general framework for min sum ordering problems. Within the realm of theoretical computer science, these problems include min sum set cover and its generalizations, as well as problems in Boolean function evaluation. On the operations research side, they include problems in search theory and scheduling. We present and analyze a very general algorithm for these problems, unifying several previous results on various min sum ordering problems and resulting in new constant factor guarantees for others.

[1]  W. A. Horn Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[2]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[3]  E. Lawler Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[4]  Ewa Kubicka,et al.  An introduction to chromatic sums , 1989, CSC '89.

[5]  N. I. Pisaruk The boundaries of submodular functions , 1992 .

[6]  George W. Furnas,et al.  Multitrees: enriching and reusing hierarchical structure , 1994, CHI '94.

[7]  Donald W. Gillies,et al.  Scheduling Tasks with AND/OR Precedence Constraints , 1995, SIAM J. Comput..

[8]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[9]  Andreas S. Schulz Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds , 1996, IPCO.

[10]  Guy Kortsarz,et al.  Minimum Color Sum of Bipartite Graphs , 1998, J. Algorithms.

[11]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

[12]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[13]  E. Boros,et al.  Sequential Testing of Series-Parallel Systems of Small Depth , 2000 .

[14]  Venkatesan Guruswami,et al.  Query strategies for priced information (extended abstract) , 2000, STOC '00.

[15]  Maurice Queyranne,et al.  Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem , 2003, Oper. Res..

[16]  Thomas Erlebach,et al.  Scheduling AND/OR-Networks on Identical Parallel Machines , 2003, WAOA.

[17]  Tonguç Ünlüyurt,et al.  Sequential testing of complex systems: a review , 2004, Discret. Appl. Math..

[18]  László Lovász,et al.  Approximating Min Sum Set Cover , 2004, Algorithmica.

[19]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[20]  Berit Johannes,et al.  On the complexity of scheduling unit-time jobs with OR-precedence constraints , 2005, Oper. Res. Lett..

[21]  Jennifer Widom,et al.  The Pipelined Set Cover Problem , 2005, ICDT.

[22]  Russell Greiner,et al.  Finding optimal satisficing strategies for and-or trees , 2006, Artif. Intell..

[23]  Monaldo Mastrolilli,et al.  Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem , 2009, Algorithmica.

[24]  Matthew J. Streeter,et al.  An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.

[25]  Alessandro Agnetis,et al.  Sequencing unreliable jobs on parallel machines , 2009, J. Sched..

[26]  Yossi Azar,et al.  Multiple intents re-ranking , 2009, STOC '09.

[27]  J. Pereira,et al.  The flowtime network construction problem , 2012 .

[28]  Satoru Iwata,et al.  Approximating Minimum Linear Ordering Problems , 2012, APPROX-RANDOM.

[29]  G. Isik,et al.  Sequential testing of 3-level deep series-parallel systems , 2013, 2013 IEEE International Conference on Industrial Engineering and Engineering Management.

[30]  Steve Alpern,et al.  Mining Coal or Finding Terrorists: The Expanding Search Paradigm , 2013, Oper. Res..

[31]  Maxim Sviridenko,et al.  Preemptive and non-preemptive generalized min sum set cover , 2014, Math. Program..

[32]  Lisa Hellerstein,et al.  Evaluation of Monotone DNF Formulas , 2015, Algorithmica.

[33]  Lisa Hellerstein,et al.  Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack , 2016, ACM Trans. Algorithms.

[34]  Robbert Fokkink,et al.  The search value of a set , 2017, Ann. Oper. Res..

[35]  Julián Mestre,et al.  Precedence-Constrained Min Sum Set Cover , 2017, ISAAC.

[36]  Lisa Hellerstein,et al.  The Stochastic Score Classification Problem , 2018, ESA.

[37]  Robbert Fokkink,et al.  On Submodular Search and Machine Scheduling , 2016, Math. Oper. Res..

[38]  Andreas S. Schulz,et al.  Precedence-Constrained Scheduling and Min-Sum Set Cover , 2019, WAOA.

[39]  Andreas S. Schulz,et al.  Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover , 2020, ArXiv.

[40]  Prasad Tetali,et al.  Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover , 2020, SODA.

[41]  Jannik Matuschke,et al.  Exact and approximation algorithms for the expanding search problem , 2019, ArXiv.