{"id":"https://openalex.org/W3136714316","doi":"https://doi.org/10.1007/s10107-011-0451-5","title":"On linear and semidefinite programming relaxations for hypergraph matching","display_name":"On linear and semidefinite programming relaxations for hypergraph matching","publication_year":2011,"publication_date":"2011-04-19","ids":{"openalex":"https://openalex.org/W3136714316","doi":"https://doi.org/10.1007/s10107-011-0451-5","mag":"3136714316"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-011-0451-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-011-0451-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5102723253","display_name":"Yuk Hei Chan","orcid":"https://orcid.org/0009-0002-4403-2971"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yuk Hei Chan","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008440961","display_name":"Lap Chi Lau","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lap Chi Lau","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.5875,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.93306971,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"135","issue":"1-2","first_page":"123","last_page":"148"},"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.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/hypergraph","display_name":"Hypergraph","score":0.9722393751144409},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7099710702896118},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6994560956954956},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6475846767425537},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6334035992622375},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5831379890441895},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4134373664855957},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3900507986545563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36709898710250854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3405839204788208},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.3270246982574463}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9722393751144409},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7099710702896118},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6994560956954956},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6475846767425537},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6334035992622375},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5831379890441895},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4134373664855957},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3900507986545563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36709898710250854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3405839204788208},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3270246982574463},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-011-0451-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-011-0451-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W162897487","https://openalex.org/W1482106463","https://openalex.org/W1548134571","https://openalex.org/W1557281301","https://openalex.org/W1575669909","https://openalex.org/W1578813712","https://openalex.org/W1607066202","https://openalex.org/W1870858037","https://openalex.org/W1963511606","https://openalex.org/W1966923282","https://openalex.org/W1970592111","https://openalex.org/W1972894929","https://openalex.org/W1976103322","https://openalex.org/W1978593916","https://openalex.org/W1984103551","https://openalex.org/W1990326132","https://openalex.org/W1991419900","https://openalex.org/W1994539900","https://openalex.org/W2001663593","https://openalex.org/W2002025272","https://openalex.org/W2003665833","https://openalex.org/W2005412366","https://openalex.org/W2006934540","https://openalex.org/W2011869755","https://openalex.org/W2012329067","https://openalex.org/W2031347356","https://openalex.org/W2031658326","https://openalex.org/W2043399762","https://openalex.org/W2049206926","https://openalex.org/W2064536540","https://openalex.org/W2069532962","https://openalex.org/W2071016718","https://openalex.org/W2077397558","https://openalex.org/W2078289947","https://openalex.org/W2080394239","https://openalex.org/W2081254453","https://openalex.org/W2082242399","https://openalex.org/W2083858754","https://openalex.org/W2088768591","https://openalex.org/W2089117840","https://openalex.org/W2100440346","https://openalex.org/W2106264302","https://openalex.org/W2107052785","https://openalex.org/W2129303870","https://openalex.org/W2140118062","https://openalex.org/W2141462088","https://openalex.org/W2146823188","https://openalex.org/W2148872782","https://openalex.org/W2149455338","https://openalex.org/W2160108357","https://openalex.org/W2172955861","https://openalex.org/W2296363261","https://openalex.org/W2402203281","https://openalex.org/W2500124111","https://openalex.org/W3123439476","https://openalex.org/W4241906804","https://openalex.org/W4388372706"],"related_works":["https://openalex.org/W2054458431","https://openalex.org/W1583170946","https://openalex.org/W4205756423","https://openalex.org/W3181584291","https://openalex.org/W2371352078","https://openalex.org/W2352066879","https://openalex.org/W2567825307","https://openalex.org/W1559931991","https://openalex.org/W2184969544","https://openalex.org/W2999621586"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}