{"id":"https://openalex.org/W881461489","doi":"https://doi.org/10.1007/s10107-015-0923-0","title":"Improved approximation algorithms for two variants of the stable marriage problem with ties","display_name":"Improved approximation algorithms for two variants of the stable marriage problem with ties","publication_year":2015,"publication_date":"2015-06-22","ids":{"openalex":"https://openalex.org/W881461489","doi":"https://doi.org/10.1007/s10107-015-0923-0","mag":"881461489"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-015-0923-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0923-0","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/A5001969602","display_name":"Chien\u2010Chung Huang","orcid":"https://orcid.org/0000-0003-3482-2646"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Chien-Chung Huang","raw_affiliation_strings":["Chalmers University of Technology, Gothenburg, Sweden","Chalmers Univ., of Technol., Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Chalmers Univ., of Technol., Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India","Tata Institute of Fundamental Research, Mumbai, India.#TAB#"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]},{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India.#TAB#","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001969602"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.2427,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87278394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"154","issue":"1-2","first_page":"353","last_page":"380"},"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.9997000098228455,"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.9997000098228455,"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.9839000105857849,"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.7953062057495117},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7403181195259094},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.7117419242858887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6917991638183594},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6814835667610168},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6135432124137878},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5593504309654236},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5323686003684998},{"id":"https://openalex.org/keywords/approx","display_name":"Approx","score":0.5149722695350647},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.46049004793167114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38734719157218933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3532410264015198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27106550335884094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12928512692451477}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7953062057495117},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7403181195259094},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.7117419242858887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6917991638183594},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6814835667610168},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6135432124137878},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5593504309654236},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5323686003684998},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.5149722695350647},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.46049004793167114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38734719157218933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3532410264015198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27106550335884094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12928512692451477},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10107-015-0923-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0923-0","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"},{"id":"pmh:oai:publications.lib.chalmers.se:229991","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/229991-improved-approximation-algorithms-for-two-variants-of-the-stable-marriage-problem-with-ties","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:229991","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/229991","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Gender equality","id":"https://metadata.un.org/sdg/5","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W5979661","https://openalex.org/W116072973","https://openalex.org/W1480100487","https://openalex.org/W1542154458","https://openalex.org/W1557896792","https://openalex.org/W1563534733","https://openalex.org/W1574082713","https://openalex.org/W1631590542","https://openalex.org/W1717788890","https://openalex.org/W1986927971","https://openalex.org/W1999336648","https://openalex.org/W2011268914","https://openalex.org/W2029062013","https://openalex.org/W2044175003","https://openalex.org/W2048888597","https://openalex.org/W2059209074","https://openalex.org/W2068115726","https://openalex.org/W2071503214","https://openalex.org/W2073547397","https://openalex.org/W2091887239","https://openalex.org/W2104372291","https://openalex.org/W2121619875","https://openalex.org/W2126904726","https://openalex.org/W2143529993","https://openalex.org/W2946234461","https://openalex.org/W4213094076","https://openalex.org/W4235234911","https://openalex.org/W4253633138"],"related_works":["https://openalex.org/W1561893369","https://openalex.org/W1500270910","https://openalex.org/W306172576","https://openalex.org/W2029062013","https://openalex.org/W4387463364","https://openalex.org/W2071503214","https://openalex.org/W4308943899","https://openalex.org/W1563534733","https://openalex.org/W1956023299","https://openalex.org/W1966674384"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}