Abstract
We consider the problem of mapping the n vertices of an edge-weighted hypergraph to the points \(1,\ldots ,n\) on the real line, so as to minimize the weighted sum of the coordinates of right ends of all edges. This problem naturally appears in warehouse logistics: n shelves are arranged in one row, every shelf can host one type of items, the edges are sets of items requested together, their weights are the request frequencies, and items must be picked from the shelves and brought to a collection point at the left end of the row. The problem is to place all items so as to minimize the average length of the collection tours. It is NP-complete even for graphs, but it can be solved in \(O^*(2^n)\) time by dynamic programming on subsets. In the present work we focus on hypergraphs with small connected components, which also has a practical motivation: Typical requests comprise related items from only one of many small disjoint groups. As a first result we solve, in polynomial time, an auxiliary problem with prescribed ordering in every component. For the unrestricted problem we conclude some worst-case time bounds that beat \(O^*(2^n)\) for components of sizes up to 6. Some simple preprocessing can further reduce the time in many instances. Furthermore, the case of star graphs can be solved via bipartite matchings. Finally, there remain various interesting open problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ambühl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM J. Comput. 40, 567–596 (2011)
Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graphs arrangements. Math. Progr. 92, 1–36 (2002)
Bhasker, J., Sahni, S.: Optimal linear arrangement of circuit components. In: HICSS 1987, vol. 2, pp. 99–111 (1987)
Boysen, N., Stephan, K.: The deterministic product location problem under a pick-by-order policy. Discr. Appl. Math. 161, 2862–2875 (2013)
Cohen, J., Fomin, F., Heggernes, P., Kratsch, D., Kucherov, G.: Optimal linear arrangement of interval graphs. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 267–279. Springer, Heidelberg (2006). https://doi.org/10.1007/11821069_24
Damaschke, P.: Ordering a sparse graph to minimize the sum of right ends of edges. In: Gąsieniec, L., Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 224–236. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-48966-3_17
Domanic, N.O., Lam, D.K., Plaxton, C.G.: Bipartite Matching with Linear Edge Weights. In: Hong, S.K. (Ed.) ISAAC 2016. LIPIcs, vol. 64, pp. 28:1–28:13. Dagstuhl (2016)
Eikel, M., Scheideler, C., Setzer, A.: Minimum linear arrangement of series-parallel graphs. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 168–180. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18263-6_15
Esteban, J.L., Ferrer-i-Cancho, R.: A correction on Shiloach’s algorithm for minimum linear arrangement of trees. SIAM J. Comput. 46, 1146–1151 (2017)
Feige, U., Lee, J.R.: An improved approximation ratio for the minimum linear arrangement problem. Info. Proc. Letters 101, 26–29 (2007)
Fellows, M.R., Hermelin, D., Rosamond, F.A., Shachnai, H.: Tractable parameterizations for the minimum linear arrangement problem. ACM Trans. Comput. Theory 8, 6:1-6:12 (2016)
Fernau, H.: Parameterized algorithmics for linear arrangement problems. Discr. Appl. Math. 156, 3166–3177 (2008)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)
Shirmohammad, P.: Linear Arrangements with Closeness Constraints, Master’s thesis, Chalmers and Univ. of Gothenburg (2020)
Acknowledgment
This work extends initial ideas from Pedram Shirmohammad’s master’s thesis [14] supervised by the author, and it is also inspired by collaboration with Raad Salman and Fredrik Ekstedt at the Fraunhofer-Chalmers Research Centre for Industrial Mathematics.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Damaschke, P. (2021). On an Ordering Problem in Weighted Hypergraphs. In: Flocchini, P., Moura, L. (eds) Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science(), vol 12757. Springer, Cham. https://doi.org/10.1007/978-3-030-79987-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-79987-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79986-1
Online ISBN: 978-3-030-79987-8
eBook Packages: Computer ScienceComputer Science (R0)