Abstract
The paper studies the following variant of clustering or laying out problems of graphs: Given a directed acyclic graph (DAG for short), the objective is to find a mapping of its nodes into blocks of size at most B that minimizes the maximum number of external arcs during traversals of the acyclic structure by following paths from the roots to the leaves. An external arc is defined as an arc connecting two distinct blocks. The problem can be shown to be NP-hard generally, and to remain intractable even if B = 2 and the height of DAGs is three. In this paper we provide a \(\frac{3}{2}\) factor linear time approximation algorithm for B = 2, and prove that the \(\frac{3}{2}\) ratio is optimal in terms of approximation guarantee. In the case of B ≥ 3, we also show that there is no \(\frac{3}{2} - \varepsilon\) factor approximation algorithm assuming P ≠ NP, where ε is arbitrarily small positive. Furthermore, we give a 2 factor approximation algorithm for B = 3 if the input is restricted to a set of layered graphs.
Supported in part by the Grant-in-Aid for Scientific Research on Priority Areas 16092223, for Scientific Research (C) 15500072, and for Young Scientists 15700021 and 17700022 from the Japanese Ministry of Education, Science, Sports and Culture.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.): Handbook of massive data sets. Kluwer Academic Pub., Dordrecht (2002)
Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
Alstrup, S., Bender, M.A., Demaine, E.D., Farach-Colton, M., Rauhe, T., Thorup, M.: Efficient tree layout in a multilevel memory hierarchy. CoRR cs.DS/0211010 (2002)
Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., Toman, D.: Structure and content scoring for XML. In: Proc. 31st VLDB, pp. 361–372 (2005)
Arge, L., Danner, A., Teh, S.-M.: I/O-efficient point location using persistent B-trees. In: Proc. 5th ALENEX, pp. 82–92 (2003)
Clark, D., Munro, J.: Efficient suffix trees on secondary storage. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 383–391 (1996)
Diwan, A.A., Rane, S., Seshadri, S., Sudarshan, S.: Clustering techniques for minimizing external path length. In: Proc. 22nd VLDB, pp. 432–353 (1996)
Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5, 691–703 (1976)
Gil, J., Itai, A.: Packing trees. In: Proc. 3rd Annual European Symposium on Algorithms, pp. 113–127 (1995); Full version: J. Algorithms 32(2), pp.108–132 (1999)
Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(28), 28–35 (1983)
Varman, P.J., Verma, R.M.: An efficient multiversion access structure. IEEE Trans. on Knowledge and Data Engineering 9(3) (1997)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Vitter, J.S.: External memory algorithms and data structures: Dealing with massive data. ACM Comput. Surveys 33(2), 209–271 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asahiro, Y., Furukawa, T., Ikegami, K., Miyano, E. (2006). How to Pack Directed Acyclic Graphs into Small Blocks. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_27
Download citation
DOI: https://doi.org/10.1007/11758471_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)