Advertisement

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks

  • Yuichi Asahiro
  • Eiji Miyano
  • Tsuyoshi YagitaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10961)

Abstract

In this paper we consider the following variant of clustering or laying out problems of graphs: Given a directed acyclic graph (DAG for short) and an integer B, 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. This paper focuses on the case \(B=2\). Even if \(B = 2\) and the height of the DAG is three, it is known that the problem is NP-hard, and furthermore, there is no \(\frac{3}{2} - \varepsilon \) factor approximation algorithm for \(B=2\) and a small positive \(\varepsilon \) unless P = NP. On the other hand, the best approximation ratio previously shown is 3. In this paper we improve the approximation ratio into strictly smaller than 2. Also, we investigate the relationship between the height of input DAGs and the inapproximability, since the above inapproximability bound \(\frac{3}{2}-\varepsilon \) is shown only for DAGs of height 3.

References

  1. 1.
    Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988).  https://doi.org/10.1145/48529.48535MathSciNetCrossRefGoogle Scholar
  2. 2.
    Asahiro, Y., Furukawa, T., Ikegami, K., Miyano, E.: How to pack directed acyclic graphs into small blocks. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 272–283. Springer, Heidelberg (2006).  https://doi.org/10.1007/11758471_27CrossRefGoogle Scholar
  3. 3.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd ed. MIT Press, pp. 612–615 (2009). Section 22.4: Topological sortGoogle Scholar
  4. 4.
    Diwan, A.A., Rane, S., Seshadri, S., Sudarshan, S.: Clustering techniques for minimizing external path length. In: Proceedings of 22nd VLDB 1996, pp. 342–353 (1996)Google Scholar
  5. 5.
    Donovan, Z., Mkrtchyan, V., Subramani, K.: On clustering without replication in combinatorial circuits. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 334–347. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-26626-8_25CrossRefzbMATHGoogle Scholar
  6. 6.
    Donovan, Z., Mkrtchyan, V., Subramani, K.: Complexity issues in some clustering problems in combinatorial circuits: when logic replication is not allowed. arXiv:1412.4051v2 (2017)
  7. 7.
    Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691–703 (1976).  https://doi.org/10.1109/SFCS.1975.21MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003).  https://doi.org/10.1007/978-3-662-04565-7CrossRefGoogle Scholar
  9. 9.
    Vitter, J.S.: Algorithms and data structures for external memory. Found. Trends Theor. Comput Sci. 2(4), 305–474 (2008).  https://doi.org/10.1561/0400000014MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Kyushu Sangyo UniversityFukuokaJapan
  2. 2.Kyushu Institute of TechnologyIizukaJapan

Personalised recommendations