A new model for the linear 1-dimensional online clustering problem

[1] S. Albers, H. Bals, Dynamic TCP acknowledgment: Penalizing long delays, SIAM J. Discrete Math. 19, 4 (2005) 938-951. ⇒16510.1137/S0895480104441656Search in Google Scholar

[2] A. Borodin, R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998. ⇒164Search in Google Scholar

[3] M. Brugger, T. Christ, F. Kemeth, S. Nagy, M. Schaefer, M. M.Pietrzyk, The FMCW technology-based indoor localization system, in: Ubiquitous Positioning Indoor Navigation and Location Based Services, 2010, pp. 1-6. ⇒16410.1109/UPINLBS.2010.5654348Search in Google Scholar

[4] M. Brugger, F. Kemeth, Locating rate adaptation by evaluating movement specific parameters, in: Adaptive Hardware and Systems, 2010, pp. 127-131. ⇒164, 16710.1109/AHS.2010.5546271Search in Google Scholar

[5] T. M. Chan, H. Zarrabi-Zadeh, A randomized algorithm for online unit clustering, in: Approximation and Online Algorithms 2007, pp. 121-131. ⇒16410.1007/11970125_10Search in Google Scholar

[6] E. G. Coffman, G. S. Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991. ⇒166Search in Google Scholar

[7] J. Csirik, L. Epstein, C. Imreh, A. Levin, Online clustering with variable sized clusters Algoritmica 65, 2 (2013) 251-274. ⇒16410.1007/s00453-011-9586-2Search in Google Scholar

[8] G. Divéki, Online clustering on the line with square cost variable sized clusters Acta Cybernetica 21, 1 (2013) 75-88. ⇒16410.14232/actacyb.21.1.2013.6Search in Google Scholar

[9] G. Divéki, C. Imreh, Online facility location with facility movements, CEJOR Cent. Eur. J. Oper. Res. 19, 2 (2011) 191-200. ⇒16410.1007/s10100-010-0153-8Search in Google Scholar

[10] D. R. Dooley, S. A. Goldman, S. D. Scott, On-line analysis of the TCP acknowledgment delay problem, Journal of the ACM 48, 2 (2001) 243-273. ⇒ 16510.1145/375827.375843Search in Google Scholar

[11] L. Epstein, R. Van Stee, On the online unit clustering problem, in: Approximation and Online Algorithms, 2008, pp. 193-206. ⇒16410.1007/978-3-540-77918-6_16Search in Google Scholar

[12] A. Fiat, G. Woeginger, Online Algorithms: The State of the Art, Springer, Heidelberg, 1998. ⇒16410.1007/BFb0029561Search in Google Scholar

[13] M. Hofri, Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation, Springer-Verlag New York, 1987. ⇒166Search in Google Scholar

[14] C. Imreh, Competitive analysis, in: Algorithms of Informatics, Vol. 1. Foundations (ed. A. Iv´anyi), mondAt Kiad´o, Budapest, 2007, pp. 395-428. ⇒ 164, 165Search in Google Scholar

[15] C. Imreh, T. Németh, On time lookahead algorithms for the online data acknowledgement problem, in: Mathematical Foundations of Computer Science, 2007, pp. 288-297. ⇒16510.1007/978-3-540-74456-6_27Search in Google Scholar

[16] C. Imreh, T. Németh, Parameter learning algorithm for the online data acknowledgment problem, Optimization Methods and Software 26, 3 (2011) 397-404. ⇒ 165, 17110.1080/10556788.2010.544313Search in Google Scholar

[17] T. Németh, S. Nagy, C. Imreh, Online data clustering algorithms in an RTLS system, Acta Univ. Sapientiae Informatica, 5, 1 (2013) 5-15. ⇒164, 17610.2478/ausi-2014-0001Search in Google Scholar

[18] T. Németh, B. Gyekiczki, C. Imreh, Parameter learning in lookahead online algorithms for data acknowledgment, Proc. 3th IEEE Symposium on Logistics and Industrial Informatics, 2011, pp. 195-198. ⇒165, 171 10.1109/LINDI.2011.6031146Search in Google Scholar