{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:12:24Z","timestamp":1743131544528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596044"},{"type":"electronic","value":"9783319596051"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_11","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T15:06:26Z","timestamp":1495465586000},"page":"115-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fluctuated Fitting Under the $$\\ell _1$$-metric"],"prefix":"10.1007","author":[{"given":"Kai","family":"Jin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1142\/S0218195906001951","volume":"16","author":"B Aronov","year":"2006","unstructured":"Aronov, B., Asano, T., Katoh, N., Mehlhorn, K., Tokuyama, T.: Polyline fitting of planar points under min-sum criteria. Int. J. Comput. Geom. Appl. 16, 97\u2013116 (2006)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/s00453-012-9658-y","volume":"66","author":"DZ Chen","year":"2013","unstructured":"Chen, D.Z., Wang, H.: Approximating points by a piecewise linear function. Algorithmica 66(3), 682\u2013713 (2013)","journal-title":"Algorithmica"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-73814-5_1","volume-title":"Frontiers in Algorithmics","author":"DZ Chen","year":"2007","unstructured":"Chen, D.Z., Healy, M.A., Wang, C., Xu, B.: Geometric algorithms for the constrained 1-D K-means clustering problems and IMRT applications. In: Preparata, F.P., Fang, Q. (eds.) FAW 2007. LNCS, vol. 4613, pp. 1\u201313. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-73814-5_1"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s00454-011-9338-8","volume":"46","author":"D Chen","year":"2011","unstructured":"Chen, D., Wang, C., Wang, H.: Representing a functional curve by curves with fewer peaks. Discret. Comput. Geom. 46(2), 334\u2013360 (2011)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00453-005-1201-y","volume":"44","author":"J Chun","year":"2006","unstructured":"Chun, J., Sadakane, K., Tokuyama, T.: Linear time algorithm for approximating a curve by a single-peaked curve. Algorithmica 44(2), 103\u2013115 (2006)","journal-title":"Algorithmica"},{"key":"11_CR6","first-page":"191","volume":"2","author":"J Chun","year":"2005","unstructured":"Chun, J., Sadakane, K., Tokuyama, T., Yuki, M.: Peak-reducing fitting of a curve under the $$l_p$$ metric. Interdisc. Inf. Sci. 2, 191\u2013197 (2005)","journal-title":"Interdisc. Inf. Sci."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1007\/11499145_88","volume-title":"Image Analysis","author":"I Cleju","year":"2005","unstructured":"Cleju, I., Fr\u00e4nti, P., Wu, X.: Clustering based on principal curve. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 872\u2013881. Springer, Heidelberg (2005). doi:10.1007\/11499145_88"},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/9780470669488.ch2","volume-title":"Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature","author":"DH Douglas","year":"2011","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature. Wiley, Hoboken (2011). pp. 15\u201328"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ipl.2012.11.003","volume":"113","author":"H Fournier","year":"2013","unstructured":"Fournier, H., Vigneron, A.: A deterministic algorithm for fitting a step function to a weighted point-set. Inf. Process. Lett. 113(3), 51\u201354 (2013)","journal-title":"Inf. Process. Lett."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-540-87744-8_37","volume-title":"Algorithms - ESA 2008","author":"H Fournier","year":"2008","unstructured":"Fournier, H., Vigneron, A.: Fitting a step function to a point set. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 442\u2013453. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-87744-8_37"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"M Goodrich","year":"1995","unstructured":"Goodrich, M.: Efficient piecewise-linear function approximation using the uniform metric. Discret. Comput. Geom. 14(1), 445\u2013462 (1995)","journal-title":"Discret. Comput. Geom."},{"issue":"7","key":"11_CR12","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/TKDE.2007.1039","volume":"19","author":"S Guha","year":"2007","unstructured":"Guha, S., Shim, K.: A note on linear time algorithms for maximum error histograms. Knowl. Data Eng. 19(7), 993\u2013997 (2007)","journal-title":"Knowl. Data Eng."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Guha, S., Koudas, N., Shim, K.: Data-streams and histograms. In: Proceedings of 33rd Symposium on Theory of Computing, STOC 2001, pp. 471\u2013475. ACM (2001)","DOI":"10.1145\/380752.380841"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10115-006-0053-3","volume":"14","author":"N Haiminen","year":"2008","unstructured":"Haiminen, N., Gionis, A., Laasonen, K.: Algorithms for unimodal segmentation with applications to unimodality detection. Knowl. Inf. Syst. 14(1), 39\u201357 (2008)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/38.920624","volume":"21","author":"DP Luebke","year":"2001","unstructured":"Luebke, D.P.: A developer\u2019s survey of polygonal simplification algorithms. IEEE Comput. Graph. Appl. 21(3), 24\u201335 (2001)","journal-title":"IEEE Comput. Graph. Appl."},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1049\/ip-vis:19952007","volume":"142","author":"N Ramesh","year":"1995","unstructured":"Ramesh, N., Yoo, J.H., Sethi, I.: Thresholding based on histogram approximation. IEEE Proc. Vis. Image Sig. Process. 142(5), 271\u2013279 (1995)","journal-title":"IEEE Proc. Vis. Image Sig. Process."},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.csda.2008.08.005","volume":"53","author":"QF Stout","year":"2008","unstructured":"Stout, Q.F.: Unimodal regression via prefix isotonic regression. Comput. Stat. Data Anal. 53(2), 289\u2013297 (2008)","journal-title":"Comput. Stat. Data Anal."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-012-9628-4","volume":"66","author":"QF Stout","year":"2013","unstructured":"Stout, Q.F.: Isotonic regression via partitioning. Algorithmica 66(1), 93\u2013112 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/s00453-013-9814-z","volume":"71","author":"QF Stout","year":"2015","unstructured":"Stout, Q.F.: Isotonic regression for multiple independent variables. Algorithmica 71(2), 450\u2013470 (2015)","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/ecjc.20297","volume":"90","author":"T Tokuyama","year":"2007","unstructured":"Tokuyama, T.: Recent progress on geometric algorithms for approximating functions: toward applications to data analysis. Electron. Commun. Jpn. (Part III: Fundam. Electron. Sci.) 90(3), 1\u201312 (2007)","journal-title":"Electron. Commun. Jpn. (Part III: Fundam. Electron. Sci.)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:26:13Z","timestamp":1710343573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}