The input/output complexity of sorting and related problems
Communications of the ACM
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Approximation algorithms
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Clustering Techniques for Minimizing External Path Length
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Efficient Tree Layout in a Multilevel Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Structure and content scoring for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
| Hi-index | 0.00 |
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.