On minimum circular arrangement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 394-405

  Ganapathy, Murali K ^a   Lodha, Sachin P ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b TATA RESEARCH DEVELOPMENT AND DESIGN CENTRE   (India)

Author keywords

Computational complexity; Hardness of approximation; Multicast; Polynomial time approximation scheme; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIRECTED GRAPHS; GRAPH THEORY; HARDNESS; MULTICASTING; SCHEDULING;

DECISION VERSION; DENSE GRAPHS; HARDNESS OF APPROXIMATION; LOWER BOUNDS; NP COMPLETE; POLYNOMIAL TIME APPROXIMATION SCHEMES; SCHEDULING PROBLEM; WEIGHTED DIRECTED GRAPH;

POLYNOMIAL APPROXIMATION;

EID: 35048841650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_35     Document Type: Article

References (25)

1. S Acharya. Broadcast Disks: Dissemination-based Data Management for Assymetric Communication Environments. PhD thesis, Brown University, May 1998.
2. D Adolphson and T C Hu. Optimal linear ordering. SIAM Journal on Applied Mathematics, 25(3):403-423, 1973.
3. K C Almeroth, M H Ammar, and Z Fei. Scalable delivery of web pages using cyclic best-effort multicast. In IEEE INFOCOM, pages 1214-1221, March 1998.
4. S Arora, A Frieze, and H Kaplan. 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, pages 21-30, October 1996.
5. S Arora, C Lund, R Motwani, M Sudan, and M Szegedy. Proof verification and hardness of approximation problems. In 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 14-23, October 1992.
6. P K Chrysanthis, V Liberalere, and K Pruhs. Middleware support for multicastbased data dissemination: A working reality, 2001. White paper.
7. F R K Chung. Theory and Applications of Graphs, chapter Some Problems and Results in Labelings of Graphs, pages 255-264. John Wiley & Sons, New York, 1981.
8. F R K Chung. On optimal linear arrangements of trees. Comp. & Maths with Applications, 10(1):43-60, 1984.
9. S Even and Y Shiloach. NP-Completeness of several arrangement problems. Technical Report 43, Isreal Institute of Technology, 1975.
10. G N Prederickson and S E Hambrusch. Planar linear arrangements of outerplanar graphs. IEEE Transactions on Circuits and Systems, 35(3):323-332, 1988.
11. A M Frieze and R Kannan. Quick approximation to matrices and applications. Combinatorica, 19(2):175-220, 1999.
12. M K Ganapathy and S Lodha. On minimum circular arrangement, 2003. URL: http://www.research.rutgers.edu/~lodha/research/ps/mca.ps.
13. M R Garey and D S Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. W H Freeman and Company, 2nd edition, 1979.
14. M R Garey, D S Johnson, and L Stockmeyer. Some simplified NP-Complete graph problems. Theoretical Computer Science, 3(1):237-267, 1976.
15. G Herman, G Gopal, K C Lee, and A Weinrib. The datacycle architecture for very high throughput data systems. In ACM SIGMOD International Conference on Management of Data, pages 97-103, May 1987.
16. M Juvan and B Mohar. Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics, 36:153-168, 1992.
17. B Krishnamurthy and J Rexford. Web Protocols and Practice. Addison-Wesley, Boston, 2001.
18. V Liberatore. Circular arrangements. In ICALP, pages 1054-1066, 2002.
19. V Liberatore. Multicast scheduling for list requests. In IEEE INFOCOM, pages 1129-1137, June 2002.
20. J Naor and R Schwartz. The directed circular arrangement problem. In 15th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2004. To appear.
21. C H Papadimitriou and M Yannakakis. Optimmization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
22. M Rabinovich. Resource management issues in content delivery networks (CDNs). In DIMACS Workshop on Resource Management and Scheduling in Next Generation Networks, 2001.
23. S Rao and A W Richa. New approximation techniques for some ordering problems. In 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211-218. ACM-SIAM, January 1998.
24. J Shanmugasundaram, A Nithrakashyap, R Sivasankaran, and K Ramamritham. Efficient concurrency control for broadcast environments. In ACM SIGMOD International Conference on Management of Data, pages 85-96, June 1999.
25. Y Shiloach. A minimum linear arrangement algorithm for undirected trees. SIAM Journal of Computing, 8(1):15-32, 1979.