{"id":"https://openalex.org/W1966569037","doi":"https://doi.org/10.1137/110852838","title":"Near-Popular Matchings in the Roommates Problem","display_name":"Near-Popular Matchings in the Roommates Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1966569037","doi":"https://doi.org/10.1137/110852838","mag":"1966569037"},"language":"en","primary_location":{"id":"doi:10.1137/110852838","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110852838","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5001969602","display_name":"Chien\u2010Chung Huang","orcid":"https://orcid.org/0000-0003-3482-2646"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chien-Chung Huang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7474,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.95130044,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"1","first_page":"43","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9943000078201294,"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.9857000112533569,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.82417231798172},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.8234140872955322},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7657694220542908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6783804297447205},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5064064264297485},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4661601483821869},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4445129632949829},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3523654341697693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15627822279930115},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07512986660003662}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.82417231798172},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.8234140872955322},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7657694220542908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6783804297447205},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5064064264297485},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4661601483821869},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4445129632949829},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3523654341697693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15627822279930115},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07512986660003662},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110852838","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110852838","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2029388009","https://openalex.org/W2033301836","https://openalex.org/W2068574579","https://openalex.org/W2096797149","https://openalex.org/W2914186512","https://openalex.org/W4235234911"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W2794488505","https://openalex.org/W4301594054","https://openalex.org/W3125889879","https://openalex.org/W3124422538","https://openalex.org/W2295467472","https://openalex.org/W3046451053","https://openalex.org/W2097909533","https://openalex.org/W3125188128","https://openalex.org/W2144398666"],"abstract_inverted_index":{"Our":[0],"input":[1],"is":[2,23,43,59,96,127,137,146],"a":[3,16,26,38,91,100,116,125,141],"graph":[4],"$G":[5],"=":[6],"(V,":[7],"E)$":[8],"where":[9],"each":[10],"vertex":[11],"ranks":[12],"its":[13],"neighbors":[14],"in":[15,28,37,105],"strict":[17],"order":[18],"of":[19,34,52,71,152],"preference.":[20],"The":[21,68],"problem":[22,110],"to":[24,57,66,139],"compute":[25,140],"matching":[27,47,78,92,101,113,126,142],"$G$":[29,88],"that":[30,54,63,87,122],"captures":[31],"the":[32,35,50,111,153],"preferences":[33],"vertices":[36,53],"popular":[39,45,82],"way.":[40],"Matching":[41],"$M$":[42,56,72],"more":[44,60,81],"than":[46,61,83],"$M'$":[48,58,65],"if":[49],"number":[51],"prefer":[55,64],"those":[62],"$M$.":[67,84],"unpopularity":[69,94,118,144],"factor":[70,76,95,119,145],"measures":[73],"by":[74],"what":[75],"any":[77,132],"can":[79,102],"be":[80,103,115],"We":[85],"show":[86,121],"always":[89],"admits":[90],"whose":[93,143],"$O(\\log|V|)$,":[97],"and":[98],"such":[99,124],"computed":[104],"linear":[106],"time.":[107],"In":[108,129],"our":[109],"optimal":[112],"would":[114],"least":[117],"matching---we":[120],"computing":[123],"NP-hard.":[128],"fact,":[130],"for":[131],"$\\epsilon":[133],">":[134],"0$,":[135],"it":[136],"NP-hard":[138],"at":[147],"most":[148],"$4/3":[149],"-":[150],"\\epsilon$":[151],"optimal.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}