{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T02:12:00Z","timestamp":1775441520190,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,4,26]],"date-time":"2009-04-26T00:00:00Z","timestamp":1240704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s12351-009-0041-y","type":"journal-article","created":{"date-parts":[[2009,4,25]],"date-time":"2009-04-25T06:29:24Z","timestamp":1240640964000},"page":"1-17","source":"Crossref","is-referenced-by-count":9,"title":["Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland"],"prefix":"10.1007","volume":"11","author":[{"given":"Steffen","family":"Borgwardt","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Brieden","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Gritzmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,26]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Brandes U, Gaertler M, Wagner D (2003) Experiments on graph clustering algorithms. Lecture notes in computer science, vol 2832\/2003, pp 568\u2013579. Springer, Berlin","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"41_CR2","unstructured":"Brieden A (2003) On the approximability of (discrete) convex maximization and its contribution to the consolidation of farmland. Habilitationsschrift. Tech. Univ., Munich"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Brieden A, Gritzmann P (2004) A quadratic optimization model for the consolidation of farmland by means of lend-lease agreements. In: Ahr D, Fahrion R, Oswald M, Reinelt G (eds) Operations research proceedings 2003: selected papers of the international conference on operations research (OR 2003). Springer, Heidelberg, pp 324\u2013331","DOI":"10.1007\/978-3-642-17022-5_42"},{"key":"41_CR4","unstructured":"Brieden A, Gritzmann P (2006) Von Ackerbau und polytopalen Halbnormen: Diskrete Optimierung f\u00fcr die Landwirtschaft. In: Hu\u00dfmann S, Lutz-Westphal B (eds) Mathematik erleben\u2014Kombinatorische Optimierung lehren und lernen. Vieweg Verlag, Wiesbaden"},{"key":"41_CR5","unstructured":"Elsner U (1997) Graph partitioning\u2014a survey. Tech. Rep. 97\u201327. Tech. Univ., Chemnitz"},{"key":"41_CR6","first-page":"1192","volume":"254","author":"A Ghoulia-Houri","year":"1962","unstructured":"Ghoulia-Houri A (1962) Caracterisation des matrices totalement unimodulaires. C R Acad Sci de Paris 254:1192\u20131194","journal-title":"C R Acad Sci de Paris"},{"key":"41_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-218X(98)00100-0","volume":"89","author":"N Guttmann-Beck","year":"1998","unstructured":"Guttmann-Beck N, Hassin R (1998) Approximation algorithms for min-sum p-clustering. Discre Appl Math 89:125\u2013142","journal-title":"Discre Appl Math"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"41_CR10","unstructured":"Orponen P, Mannila H (1987) On approximation preserving reductions: complete problems and robust measures. Technical Report C-1987-28, Department of Computer Science, University of Helsinki"},{"key":"41_CR11","first-page":"349","volume":"41","author":"R Ostrovsky","year":"2000","unstructured":"Ostrovsky R, Rabani Y (2000) Polynomial time approximation schemes for geometric-k-clustering. IEEE Symp Found Comput Sci 41:349\u2013358","journal-title":"IEEE Symp Found Comput Sci"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-009-0041-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-009-0041-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-009-0041-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:04:33Z","timestamp":1559462673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-009-0041-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,26]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1007\/s12351-009-0041-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,26]]}}}