{"id":"https://openalex.org/W1540317250","doi":"https://doi.org/10.1007/3-540-57785-8_164","title":"Efficient parallel algorithms for geometric k-clustering problems","display_name":"Efficient parallel algorithms for geometric k-clustering problems","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1540317250","doi":"https://doi.org/10.1007/3-540-57785-8_164","mag":"1540317250"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-57785-8_164","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57785-8_164","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005705210","display_name":"Amitava Datta","orcid":"https://orcid.org/0000-0001-6916-7907"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Amitava Datta","raw_affiliation_strings":["Praktische Informatik VI, Fern Universit\u00e4t Hagen, Elberfelderstra\u00dfe 95, D-58084, Hagen, Germany","Fern Universit\u00e4t, Hagen"],"affiliations":[{"raw_affiliation_string":"Praktische Informatik VI, Fern Universit\u00e4t Hagen, Elberfelderstra\u00dfe 95, D-58084, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]},{"raw_affiliation_string":"Fern Universit\u00e4t, Hagen","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005705210"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5751,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60887097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"475","last_page":"486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/perimeter","display_name":"Perimeter","score":0.5897449851036072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5816178321838379},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5352386236190796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5328783392906189},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5317355990409851},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5288708806037903},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5073298811912537},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4584304094314575},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4102836549282074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3725678622722626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.336079478263855},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09787729382514954},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0904131829738617}],"concepts":[{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.5897449851036072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5816178321838379},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5352386236190796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5328783392906189},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5317355990409851},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5288708806037903},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5073298811912537},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4584304094314575},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4102836549282074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3725678622722626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.336079478263855},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09787729382514954},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0904131829738617}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-57785-8_164","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57785-8_164","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W256259101","https://openalex.org/W1596202017","https://openalex.org/W1965333879","https://openalex.org/W1978583881","https://openalex.org/W1989915986","https://openalex.org/W2005314985","https://openalex.org/W2007245812","https://openalex.org/W2019315437","https://openalex.org/W2040895999","https://openalex.org/W2046227217","https://openalex.org/W2066374992","https://openalex.org/W2112530897","https://openalex.org/W2120490947","https://openalex.org/W2137154725","https://openalex.org/W2162487598","https://openalex.org/W2911302472","https://openalex.org/W2913066018","https://openalex.org/W4231375265"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W78560857"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}