Abstract
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Minimum Circular Arrangement (MCA), that requires one to find an embedding of a given weighted directed graph into a discrete circle which minimizes the total weighted arc length. Its decision version is already known to be NP-complete when restricted to sparse weighted instances. We prove that the decision version of even un-weighted MCA is NP-complete in case of sparse as well as dense graphs.
We also consider complementary version of MCA, called MaxCA. We prove that it is MAX-SNP[π] complete and, therefore, has no PTAS unless P=NP. A similar proof technique shows that MCA is MAX-SNP[π]-Hard and hence admits no PTAS as well. Then we prove a conditional lower bound of \(\sqrt{2} - \epsilon\) for MCA approximation under some hardness assumptions, and conclude with a PTAS for MCA on dense instances.
Keywords
Full version of the paper is available online [12].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Acharya, S.: Broadcast Disks: Dissemination-based Data Management for Assymetric Communication Environments. PhD thesis, Brown University (May 1998)
Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM Journal on Applied Mathematics 25(3), 403–423 (1973)
Almeroth, K.C., Ammar, M.H., Fei, Z.: Scalable delivery of web pages using cyclic best-effort multicast. In: IEEE INFOCOM, March 1998, pp. 1214–1221 (1998)
Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In: 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 21–30 (October 1996)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 14–23 (October 1992)
Chrysanthis, P.K., Liberatore, V., Pruhs, K.: Middleware support for multicastbased data dissemination: A working reality (2001) (White paper)
Chung, F.R.K.: Some Problems and Results in Labelings of Graphs. In: Theory and Applications of Graphs, pp. 255–264. John Wiley & Sons, New York (1981)
Chung, F.R.K.: On optimal linear arrangements of trees. Comp. & Maths with Applications 10(1), 43–60 (1984)
Even, S., Shiloach, Y.: NP-Completeness of several arrangement problems. Technical Report 43, Isreal Institute of Technology (1975)
Frederickson, G.N., Hambrusch, S.E.: Planar linear arrangements of outerplanar graphs. IEEE Transactions on Circuits and Systems 35(3), 323–332 (1988)
Frieze, A.M., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19(2), 175–220 (1999)
Ganapathy, M.K., Lodha, S.: On minimum circular arrangement (2003), http://www.research.rutgers.edu/~lodha/research/ps/mca.ps
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness, 2nd edn. W.H. Freeman and Company, New York (1979)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-Complete graph problems. Theoretical Computer Science 3(1), 237–267 (1976)
Herman, G., Gopal, G., Lee, K.C., Weinrib, A.: The datacycle architecture for very high throughput data systems. In: ACM SIGMOD International Conference on Management of Data, pp. 97–103 (May 1987)
Juvan, M., Mohar, B.: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics 36, 153–168 (1992)
Krishnamurthy, B., Rexford, J.: Web Protocols and Practice. Addison-Wesley, Boston (2001)
Liberatore, V.: Circular arrangements. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 1054–1066. Springer, Heidelberg (2002)
Liberatore, V.: Multicast scheduling for list requests. In: IEEE INFOCOM, pp. 1129–1137 (June 2002)
Naor, J., Schwartz, R.: The directed circular arrangement problem. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (January 2004) (to appear)
Papadimitriou, C.H., Yannakakis, M.: Optimmization, approximation and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)
Rabinovich, M.: Resource management issues in content delivery networks (CDNs). In: DIMACS Workshop on Resource Management and Scheduling in Next Generation Networks (2001)
Rao, S., Richa, A.W.: New approximation techniques for some ordering problems. In: 9th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1998, pp. 211–218. ACM-SIAM (1998)
Shanmugasundaram, J., Nithrakashyap, A., Sivasankaran, R., Ramamritham, K.: Efficient concurrency control for broadcast environments. In: ACM SIGMOD International Conference on Management of Data, June 1999, pp. 85–96 (1999)
Shiloach, Y.: A minimum linear arrangement algorithm for undirected trees. SIAM Journal of Computing 8(1), 15–32 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganapathy, M.K., Lodha, S.P. (2004). On Minimum Circular Arrangement. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive