Abstract
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally unimodular. Still, sometimes it is possible to build an integer solution with the same cost from the fractional solution. Examples are two scheduling problems (Baptiste and Schieber, J. Sched. 6(4):395–404, 2003; Brucker and Kravchenko, J. Sched. 11(4):229–237, 2008) and the single disk prefetching/caching problem (Albers et al., J. ACM 47:969–986, 2000). We show that problems such as the three previously mentioned can be separated into two subproblems: (1) finding an optimal feasible set of slots, and (2) assigning the jobs or pages to the slots. It is straigthforward to show that the latter can be solved greedily. We are able to solve the former with a totally unimodular linear program, from which we obtain simple combinatorial algorithms with improved worst case running time.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, New York (1993)
Albers, S., Büttner, M.: Integrated prefetching and caching in single and parallel disk systems. Inf. Comput. 198, 24–39 (2005)
Albers, S., Garg, N., Leonardi, S.: Minimizing stall time in single and parallel disk systems. J. ACM 47, 969–986 (2000)
Baptiste, P., Schieber, B.: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness. J. Sched. 6(4), 395–404 (2003)
Brucker, P.: Scheduling Algorithms. Springer, Berlin (2001)
Brucker, P., Kravchenko, S.: Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Sched. 11(4), 229–237 (2008)
Cao, P., Felten, E.W., Karlin, A.R., Li, K.: Implementation and performance of integrated application-controlled caching, prefetching and disk scheduling. ACM Trans. Comput. Syst. 188–196 (1995)
Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935)
Orlin, J.B.: A faster strongly polynomial algorithm for the minimum cost flow problem. Oper. Res. 41, 338–350 (1993)
Simons, B.: A fast algorithm for single processor scheduling. In: Proceedings IEEE 19th Annual Symposium on Foundations of Computer Science (FOCS’78), pp. 246–252 (1978)
Simons, B., Warmuth, M.: A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM J. Comput. 18(4), 690–710 (1989)
van Leeuwen, J.: HandBook of Theoretical Computer Science. Algorithms and Complexity, vol. A. Elsevier, Amsterdam (1990)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by CNRS/NSF grant 17171 and ANR Alpage.
Rights and permissions
About this article
Cite this article
Dürr, C., Hurand, M. Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. Algorithmica 59, 256–268 (2011). https://doi.org/10.1007/s00453-009-9310-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9310-7