{"id":"https://openalex.org/W1594302759","doi":"https://doi.org/10.1007/978-3-662-43948-7_47","title":"Changing Bases: Multistage Optimization for Matroids and Matchings","display_name":"Changing Bases: Multistage Optimization for Matroids and Matchings","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1594302759","doi":"https://doi.org/10.1007/978-3-662-43948-7_47","mag":"1594302759"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-43948-7_47","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43948-7_47","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Computer Science Dept., Carnegie Mellon University, Pittsburgh, PA, 15213, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept., Carnegie Mellon University, Pittsburgh, PA, 15213, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080065269","display_name":"Kunal Talwar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210086253","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210086253"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal Talwar","raw_affiliation_strings":["Microsoft Research Silicon Valley, 1065 La Avenida, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, 1065 La Avenida, Mountain View, CA, USA","institution_ids":["https://openalex.org/I4210086253","https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025142058","display_name":"Udi Wieder","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210086253","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210086253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Udi Wieder","raw_affiliation_strings":["Microsoft Research Silicon Valley, 1065 La Avenida, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, 1065 La Avenida, Mountain View, CA, USA","institution_ids":["https://openalex.org/I4210086253","https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.536,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.89045835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"563","last_page":"575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T11478","display_name":"Caching and Content Delivery","score":0.9944000244140625,"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/matroid","display_name":"Matroid","score":0.948586106300354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6375516653060913},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5675089955329895},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46655601263046265},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.452353298664093},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44047561287879944},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41948795318603516},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40961211919784546},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.356588214635849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34014540910720825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2921780049800873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26486462354660034}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.948586106300354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6375516653060913},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5675089955329895},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46655601263046265},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.452353298664093},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44047561287879944},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41948795318603516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40961211919784546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.356588214635849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34014540910720825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2921780049800873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26486462354660034}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-43948-7_47","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43948-7_47","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1518018875","https://openalex.org/W1528796068","https://openalex.org/W1543614321","https://openalex.org/W1561966979","https://openalex.org/W1570963478","https://openalex.org/W1594302759","https://openalex.org/W1680189815","https://openalex.org/W1824000689","https://openalex.org/W1864228528","https://openalex.org/W1969999211","https://openalex.org/W1981351071","https://openalex.org/W2016757663","https://openalex.org/W2029437526","https://openalex.org/W2029828838","https://openalex.org/W2060427246","https://openalex.org/W2071016718","https://openalex.org/W2071608792","https://openalex.org/W2077124610","https://openalex.org/W2094067695","https://openalex.org/W2114538202","https://openalex.org/W2120872275","https://openalex.org/W2122886291","https://openalex.org/W2129866531","https://openalex.org/W2153644134","https://openalex.org/W2157054705","https://openalex.org/W2170363144","https://openalex.org/W2172490232","https://openalex.org/W2274097845","https://openalex.org/W2340149117","https://openalex.org/W2405916087","https://openalex.org/W2408313839","https://openalex.org/W2953124404","https://openalex.org/W4243320487"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W2512208967","https://openalex.org/W2962917430","https://openalex.org/W1553492721","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}