{"id":"https://openalex.org/W2033556263","doi":"https://doi.org/10.1016/s1570-8667(03)00079-0","title":"Approximation algorithms for Hamming clustering problems","display_name":"Approximation algorithms for Hamming clustering problems","publication_year":2003,"publication_date":"2003-12-31","ids":{"openalex":"https://openalex.org/W2033556263","doi":"https://doi.org/10.1016/s1570-8667(03)00079-0","mag":"2033556263"},"language":"en","primary_location":{"id":"doi:10.1016/s1570-8667(03)00079-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1570-8667(03)00079-0","pdf_url":null,"source":{"id":"https://openalex.org/S163424111","display_name":"Journal of Discrete Algorithms","issn_l":"1570-8667","issn":["1570-8667","1570-8675"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Discrete Algorithms","raw_type":"journal-article"},"type":"article","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/A5052366414","display_name":"Leszek G\u0105sieniec","orcid":"https://orcid.org/0000-0003-1809-9814"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Leszek Ga\u0327sieniec","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Peach Street, Liverpool, L69 7ZF, UK","#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Peach Street, Liverpool, L69 7ZF, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060626918","display_name":"Jesper Jansson","orcid":"https://orcid.org/0000-0001-6859-8932"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jesper Jansson","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052366414"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":1.4663,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.81889679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"2","first_page":"289","last_page":"301"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.8576409816741943},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8199797868728638},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.685386061668396},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6292136311531067},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5491153001785278},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.48768866062164307},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4800761342048645},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.4759916067123413},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47072258591651917},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.45272377133369446},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4277569055557251},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42732134461402893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42267823219299316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30723947286605835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12716299295425415}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.8576409816741943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8199797868728638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.685386061668396},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6292136311531067},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5491153001785278},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.48768866062164307},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4800761342048645},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.4759916067123413},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47072258591651917},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.45272377133369446},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4277569055557251},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42732134461402893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42267823219299316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30723947286605835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12716299295425415},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1570-8667(03)00079-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1570-8667(03)00079-0","pdf_url":null,"source":{"id":"https://openalex.org/S163424111","display_name":"Journal of Discrete Algorithms","issn_l":"1570-8667","issn":["1570-8667","1570-8675"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Discrete Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:7d92de4f-efc8-4112-ae13-97e5207d062b","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/631616","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1570-8667","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1572177545","https://openalex.org/W1973264045","https://openalex.org/W1979253499","https://openalex.org/W1983410903","https://openalex.org/W1990061958","https://openalex.org/W1990169993","https://openalex.org/W1990313671","https://openalex.org/W2011039300","https://openalex.org/W2044028871","https://openalex.org/W2073583237","https://openalex.org/W2077595184","https://openalex.org/W2085239230","https://openalex.org/W2103658959","https://openalex.org/W2111385661","https://openalex.org/W2133311553","https://openalex.org/W2202947145","https://openalex.org/W3198030640","https://openalex.org/W4285719527","https://openalex.org/W4389615664","https://openalex.org/W6641236819","https://openalex.org/W6645057956","https://openalex.org/W6671949006","https://openalex.org/W6679494916"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W2152162311","https://openalex.org/W1530654122","https://openalex.org/W2182731056","https://openalex.org/W3013281356"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-06-24T00:00:00"}