{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:37:30Z","timestamp":1743079050304,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02158-9_24","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:36:06Z","timestamp":1245252966000},"page":"279-291","source":"Crossref","is-referenced-by-count":0,"title":["Latency Constrained Aggregation in Chain Networks Admits a PTAS"],"prefix":"10.1007","author":[{"given":"Tim","family":"Nonner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"I.F. Akyildiz","year":"2002","unstructured":"Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw.\u00a038(4), 393\u2013422 (2002)","journal-title":"Comput. Netw."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11841036_11","volume-title":"Algorithms \u2013 ESA 2006","author":"L. Becchetti","year":"2006","unstructured":"Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: Latency constrained aggregation in sensor networks. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 88\u201399. Springer, Heidelberg (2006)"},{"key":"24_CR3","unstructured":"Brito, C., Koutsoupias, E., Vaya, S.: Competitive analysis of organization networks or multicast acknowledgement: how much to wait? In: Proc. of the 15th annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 627\u2013635 (2004)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Alg.\u00a04(3) (2008)","DOI":"10.1145\/1367064.1367074"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jagm.2002.1221","volume":"43","author":"D.R. Gaur","year":"2002","unstructured":"Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. J. Algorithms\u00a043(1), 138\u2013152 (2002)","journal-title":"J. Algorithms"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1051\/ro:2007024","volume":"41","author":"D. Gijswijt","year":"2007","unstructured":"Gijswijt, D., Jost, V., Queyranne, M.: Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO - Operations Research\u00a041(3), 275\u2013287 (2007)","journal-title":"RAIRO - Operations Research"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Glasser, C., Schmitz, H., Reitwiessner, C.: Multiobjective disk cover admits a PTAS. In: Proc. of the 19th International Symposium on Algorithms and Computation (ISSAC) (2008)","DOI":"10.1007\/978-3-540-92182-0_7"},{"key":"24_CR8","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co, Amsterdam (2004)"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics\u00a030(1), 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45465-9_13","volume-title":"Automata, Languages and Programming","author":"S. Khanna","year":"2002","unstructured":"Khanna, S., Naor, J(S.), Raz, D.: Control message aggregation in group communication protocols. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 135\u2013146. Springer, Heidelberg (2002)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-72951-8_12","volume-title":"Structural Information and Communication Complexity","author":"P. Korteweg","year":"2007","unstructured":"Korteweg, P., Marchetti-Spaccamela, A., Stougie, L., Vitaletti, A.: Data aggregation in sensor networks: Balancing communication and delay costs. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 139\u2013150. Springer, Heidelberg (2007)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Krishnamachari, B., Estrin, D., Wicker, S.B.: The impact of data aggregation in wireless sensor networks. In: Proc. of the 29th International Conference on Distributed Computing Systems (ICDCS), pp. 575\u2013578 (2002)","DOI":"10.1109\/ICDCSW.2002.1030829"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program.\u00a046(3), 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Oswald, Y.A., Schmid, S., Wattenhofer, R.: Tight bounds for delay-sensitive aggregation. In: Proc. of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 195\u2013202 (2008)","DOI":"10.1145\/1400751.1400778"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-61680-2_82","volume-title":"Algorithms - ESA \u201996","author":"C.H. Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H.: Computational aspects of organization theory (extended abstract). In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 559\u2013564. Springer, Heidelberg (1996)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"24_CR18","unstructured":"Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-latency tradeoffs for data gathering in wireless sensor networks. In: Proc. of the 23rd Conference of the IEEE Communications Society (INFOCOM) (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:42:48Z","timestamp":1739166168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}