{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:30:29Z","timestamp":1740547829423,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_35","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"394-405","source":"Crossref","is-referenced-by-count":4,"title":["On Minimum Circular Arrangement"],"prefix":"10.1007","author":[{"given":"Murali K","family":"Ganapathy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin P","family":"Lodha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Acharya, S.: Broadcast Disks: Dissemination-based Data Management for Assymetric Communication Environments. PhD thesis, Brown University (May 1998)"},{"issue":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D. Adolphson","year":"1973","unstructured":"Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM Journal on Applied Mathematics\u00a025(3), 403\u2013423 (1973)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"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\u20131221 (1998)","DOI":"10.1109\/INFCOM.1998.662935"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"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\u201330 (October 1996)","DOI":"10.1109\/SFCS.1996.548460"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"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\u201323 (October 1992)","DOI":"10.1109\/SFCS.1992.267823"},{"key":"35_CR6","unstructured":"Chrysanthis, P.K., Liberatore, V., Pruhs, K.: Middleware support for multicastbased data dissemination: A working reality (2001) (White paper)"},{"key":"35_CR7","first-page":"255","volume-title":"Theory and Applications of Graphs","author":"F.R.K. Chung","year":"1981","unstructured":"Chung, F.R.K.: Some Problems and Results in Labelings of Graphs. In: Theory and Applications of Graphs, pp. 255\u2013264. John Wiley & Sons, New York (1981)"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","volume":"10","author":"F.R.K. Chung","year":"1984","unstructured":"Chung, F.R.K.: On optimal linear arrangements of trees. Comp. & Maths with Applications\u00a010(1), 43\u201360 (1984)","journal-title":"Comp. & Maths with Applications"},{"key":"35_CR9","unstructured":"Even, S., Shiloach, Y.: NP-Completeness of several arrangement problems. Technical Report 43, Isreal Institute of Technology (1975)"},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/31.1745","volume":"35","author":"G.N. Frederickson","year":"1988","unstructured":"Frederickson, G.N., Hambrusch, S.E.: Planar linear arrangements of outerplanar graphs. IEEE Transactions on Circuits and Systems\u00a035(3), 323\u2013332 (1988)","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A.M. Frieze","year":"1999","unstructured":"Frieze, A.M., Kannan, R.: Quick approximation to matrices and applications. Combinatorica\u00a019(2), 175\u2013220 (1999)","journal-title":"Combinatorica"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Ganapathy, M.K., Lodha, S.: On minimum circular arrangement (2003), http:\/\/www.research.rutgers.edu\/~lodha\/research\/ps\/mca.ps","DOI":"10.1007\/978-3-540-24749-4_35"},{"key":"35_CR13","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"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)","edition":"2"},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"3","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-Complete graph problems. Theoretical Computer Science\u00a03(1), 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013103 (May 1987)","DOI":"10.1145\/38714.38729"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"36","author":"M. Juvan","year":"1992","unstructured":"Juvan, M., Mohar, B.: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics\u00a036, 153\u2013168 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR17","volume-title":"Web Protocols and Practice","author":"B. Krishnamurthy","year":"2001","unstructured":"Krishnamurthy, B., Rexford, J.: Web Protocols and Practice. Addison-Wesley, Boston (2001)"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1007\/3-540-45465-9_90","volume-title":"Automata, Languages and Programming","author":"V. Liberatore","year":"2002","unstructured":"Liberatore, V.: Circular arrangements. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 1054\u20131066. Springer, Heidelberg (2002)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Liberatore, V.: Multicast scheduling for list requests. In: IEEE INFOCOM, pp. 1129\u20131137 (June 2002)","DOI":"10.1109\/INFCOM.2002.1019361"},{"key":"35_CR20","unstructured":"Naor, J., Schwartz, R.: The directed circular arrangement problem. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (January 2004) (to appear)"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimmization, approximation and complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR22","unstructured":"Rabinovich, M.: Resource management issues in content delivery networks (CDNs). In: DIMACS Workshop on Resource Management and Scheduling in Next Generation Networks (2001)"},{"key":"35_CR23","unstructured":"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\u2013218. ACM-SIAM (1998)"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"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\u201396 (1999)","DOI":"10.1145\/304181.304190"},{"issue":"1","key":"35_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/0208002","volume":"8","author":"Y. Shiloach","year":"1979","unstructured":"Shiloach, Y.: A minimum linear arrangement algorithm for undirected trees. SIAM Journal of Computing\u00a08(1), 15\u201332 (1979)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:09:04Z","timestamp":1740503344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}