{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:09:17Z","timestamp":1761718157225,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_6","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"62-73","source":"Crossref","is-referenced-by-count":13,"title":["Approximating the Bandwidth of Caterpillars"],"prefix":"10.1007","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical report, University of Bonn (1997)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P. Chinn","year":"1982","unstructured":"Chinn, P., Chvat\u00e1lov\u00e1, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices - survey. Journal of Graph Theory\u00a06(3), 223\u2013254 (1982)","journal-title":"Journal of Graph Theory"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(89)90083-6","volume":"75","author":"F.R. Chung","year":"1989","unstructured":"Chung, F.R., Seymour, P.D.: Graphs with small bandwidth and cutwidth. Discrete Mathematics\u00a075, 113\u2013119 (1989)","journal-title":"Discrete Mathematics"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44666-4_26","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"J. Dunagan","year":"2001","unstructured":"Dunagan, J., Vempala, S.: On euclidean embeddings and bandwidth minimization. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 229\u2013240. Springer, Heidelberg (2001)"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/jcss.1999.1682","volume":"60","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci.\u00a060(3), 510\u2013539 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44985-X_2","volume-title":"Algorithm Theory - SWAT 2000","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Coping with the NP-hardness of the graph bandwidth problem. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 10\u201319. Springer, Heidelberg (2000)"},{"key":"6_CR7","unstructured":"Filmus, Y.: Master\u2019s thesis, Weizmann Institute (2003)"},{"key":"6_CR8","unstructured":"Gupta: Improved bandwidth approximation for trees. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 788\u2013793 (2000)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Haralambides, J., Makedon, F., Monien, B.: Bandwidth minimization: An approximation algorithm for caterpillars. Mathematical Systems Theory, 169\u2013177 (1991)","DOI":"10.1007\/BF02090396"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Lee, J., Mendel, M., Naor, A.: Measured descent: A new embedding method for finite metrics. In: FOCS, pp. 434\u2013443 (2004)","DOI":"10.1109\/FOCS.2004.41"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B. Monien","year":"1986","unstructured":"Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algebraic Discrete Methods\u00a07(4), 505\u2013512 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.: The NP-completeness of the bandwidth minimization problem. Computing\u00a016, 263\u2013270 (1976)","journal-title":"Computing"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J. Saxe","year":"1980","unstructured":"Saxe, J.: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discrete Methods\u00a01, 363\u2013369 (1980)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Unger, W.: The complexity of the approximation of the bandwidth problem. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 82\u201391 (1998)","DOI":"10.1109\/SFCS.1998.743431"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:06:42Z","timestamp":1740539202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11538462_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}