{"id":"https://openalex.org/W2073547397","doi":"https://doi.org/10.3390/a6030471","title":"Linear Time Local Approximation Algorithm for Maximum Stable Marriage","display_name":"Linear Time Local Approximation Algorithm for Maximum Stable Marriage","publication_year":2013,"publication_date":"2013-08-15","ids":{"openalex":"https://openalex.org/W2073547397","doi":"https://doi.org/10.3390/a6030471","mag":"2073547397"},"language":"en","primary_location":{"id":"doi:10.3390/a6030471","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030471","pdf_url":"https://www.mdpi.com/1999-4893/6/3/471/pdf?version=1376906966","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/6/3/471/pdf?version=1376906966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090547771","display_name":"Zolt\u00e1n Kir\u00e1ly","orcid":"https://orcid.org/0000-0002-9815-5793"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Zolt\u00e1n Kir\u00e1ly","raw_affiliation_strings":["Department of Computer Science and MTA-ELTE Egerv\u00e1ry Research Group, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9tany 1/C, Budapest 1117, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and MTA-ELTE Egerv\u00e1ry Research Group, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9tany 1/C, Budapest 1117, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090547771"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":27.6557,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.99402771,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"471","last_page":"484"},"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.9998999834060669,"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.9998999834060669,"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.970300018787384,"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/T11182","display_name":"Auction Theory and Applications","score":0.9549000263214111,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.7270185947418213},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.7121983766555786},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7027007937431335},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5287100076675415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5174410939216614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.458488404750824},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4579668343067169},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4454878270626068},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42726930975914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40293070673942566},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15418994426727295}],"concepts":[{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.7270185947418213},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.7121983766555786},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7027007937431335},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5287100076675415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5174410939216614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.458488404750824},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4579668343067169},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4454878270626068},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42726930975914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40293070673942566},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15418994426727295}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a6030471","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030471","pdf_url":"https://www.mdpi.com/1999-4893/6/3/471/pdf?version=1376906966","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:6179c87042884c629a3937fa8bda1f7f","is_oa":true,"landing_page_url":"https://doaj.org/article/6179c87042884c629a3937fa8bda1f7f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 6, Iss 3, Pp 471-484 (2013)","raw_type":"article"},{"id":"pmh:oai:edit.elte.hu:10831/91321","is_oa":true,"landing_page_url":"http://hdl.handle.net/10831/91321","pdf_url":null,"source":{"id":"https://openalex.org/S4306400126","display_name":"ELTE Digital Institutional Repository (EDIT) (E\u00f6tv\u00f6s Lor\u00e1nd University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I106118109","host_organization_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","host_organization_lineage":["https://openalex.org/I106118109"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:mdpi.com:/1999-4893/6/3/471/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a6030471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 6; Issue 3; Pages: 471-484","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a6030471","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030471","pdf_url":"https://www.mdpi.com/1999-4893/6/3/471/pdf?version=1376906966","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2073547397.pdf","grobid_xml":"https://content.openalex.org/works/W2073547397.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W5979661","https://openalex.org/W1480100487","https://openalex.org/W1563534733","https://openalex.org/W1631590542","https://openalex.org/W1999336648","https://openalex.org/W2029062013","https://openalex.org/W2044175003","https://openalex.org/W2047812342","https://openalex.org/W2059209074","https://openalex.org/W2068115726","https://openalex.org/W2071503214","https://openalex.org/W2091887239","https://openalex.org/W2126904726","https://openalex.org/W2133312780","https://openalex.org/W2135834608","https://openalex.org/W2153000253","https://openalex.org/W2165621523","https://openalex.org/W4253633138","https://openalex.org/W6823982362"],"related_works":["https://openalex.org/W1976524344","https://openalex.org/W4322508012","https://openalex.org/W3123407378","https://openalex.org/W2054731762","https://openalex.org/W2072430061","https://openalex.org/W4224297439","https://openalex.org/W4377864796","https://openalex.org/W1759995226","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,51],"consider":[1],"a":[2,17,27,37,53],"two-sided":[3],"market":[4],"under":[5],"incomplete":[6],"preference":[7,49],"lists":[8,92],"with":[9,62],"ties,":[10],"where":[11],"the":[12,63,95,98,108],"goal":[13],"is":[14,24],"to":[15,107],"find":[16],"maximum":[18],"size":[19],"stable":[20],"matching.":[21],"The":[22],"problem":[23,110],"APX-hard,":[25],"and":[26,84,103],"3/2-approximation":[28],"was":[29],"given":[30],"by":[31],"McDermid":[32],"[1].":[33],"This":[34],"algorithm":[35,61,74,100],"has":[36],"non-linear":[38],"running":[39],"time,":[40],"and,":[41],"more":[42],"importantly":[43],"needs":[44],"global":[45],"knowledge":[46],"of":[47,69,90,97,101],"all":[48],"lists.":[50],"present":[52],"very":[54],"natural,":[55],"economically":[56],"reasonable,":[57],"local,":[58],"linear":[59],"time":[60],"same":[64],"ratio,":[65],"using":[66,79],"some":[67,85],"ideas":[68],"Paluch":[70],"[2].":[71],"In":[72],"this":[73],"every":[75],"person":[76],"make":[77],"decisions":[78],"only":[80],"their":[81],"own":[82],"list,":[83],"information":[86],"asked":[87],"from":[88],"members":[89],"these":[91],"(as":[93],"in":[94],"case":[96],"famous":[99],"Gale":[102],"Shapley).":[104],"Some":[105],"consequences":[106],"Hospitals/Residents":[109],"are":[111],"also":[112],"discussed.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}