{"id":"https://openalex.org/W2767081117","doi":"https://doi.org/10.1007/s00453-017-0383-4","title":"Improved Bounds in Stochastic Matching and Optimization","display_name":"Improved Bounds in Stochastic Matching and Optimization","publication_year":2017,"publication_date":"2017-10-23","ids":{"openalex":"https://openalex.org/W2767081117","doi":"https://doi.org/10.1007/s00453-017-0383-4","mag":"2767081117"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0383-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0383-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5075956595","display_name":"Alok Baveja","orcid":"https://orcid.org/0000-0001-7228-7731"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alok Baveja","raw_affiliation_strings":["Department of Supply Chain Management, Rutgers Business School, Rutgers, The State University of New Jersey, Piscataway, NJ, 08854, USA"],"affiliations":[{"raw_affiliation_string":"Department of Supply Chain Management, Rutgers Business School, Rutgers, The State University of New Jersey, Piscataway, NJ, 08854, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004324975","display_name":"Amit Chavan","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Chavan","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032006889","display_name":"Andrei Nikiforov","orcid":"https://orcid.org/0000-0003-3189-8282"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrei Nikiforov","raw_affiliation_strings":["School of Business, Rutgers, The State University of New Jersey, Camden, NJ, 08102, USA"],"affiliations":[{"raw_affiliation_string":"School of Business, Rutgers, The State University of New Jersey, Camden, NJ, 08102, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007399946","display_name":"Pan Xu","orcid":"https://orcid.org/0000-0002-6362-6727"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pan Xu","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5075956595"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0963,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.81612865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"80","issue":"11","first_page":"3225","last_page":"3252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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":0.9994999766349792,"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.9983000159263611,"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/T10237","display_name":"Cryptography and Data Security","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/stochastic-optimization","display_name":"Stochastic optimization","score":0.675244927406311},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.6714465618133545},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6086351871490479},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6053910851478577},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5847586989402771},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5780355930328369},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5513819456100464},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5028356909751892},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.49179723858833313},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4741080403327942},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.47024789452552795},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45525726675987244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44599464535713196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33987724781036377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19453227519989014}],"concepts":[{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.675244927406311},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.6714465618133545},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6086351871490479},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6053910851478577},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5847586989402771},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5780355930328369},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5513819456100464},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5028356909751892},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.49179723858833313},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4741080403327942},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.47024789452552795},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45525726675987244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44599464535713196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33987724781036377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19453227519989014},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-017-0383-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0383-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1749484715","display_name":null,"funder_award_id":"1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4468844544","display_name":null,"funder_award_id":"49198-25-26","funder_id":"https://openalex.org/F4320306108","funder_display_name":"U.S. Department of Transportation"},{"id":"https://openalex.org/G8911331200","display_name":null,"funder_award_id":"1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306108","display_name":"U.S. Department of Transportation","ror":"https://ror.org/02xfw2e90"},{"id":"https://openalex.org/F4320307786","display_name":"Adobe Systems","ror":"https://ror.org/059tvcg64"},{"id":"https://openalex.org/F4320320270","display_name":"UK-India Education and Research Initiative","ror":"https://ror.org/037dz3r63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W347166089","https://openalex.org/W1484951415","https://openalex.org/W1490324987","https://openalex.org/W1512460878","https://openalex.org/W1541527977","https://openalex.org/W1569990960","https://openalex.org/W1577719727","https://openalex.org/W1788659242","https://openalex.org/W1899379166","https://openalex.org/W1909971775","https://openalex.org/W1976103322","https://openalex.org/W1983916623","https://openalex.org/W2000257769","https://openalex.org/W2002285507","https://openalex.org/W2007604989","https://openalex.org/W2019875157","https://openalex.org/W2041025394","https://openalex.org/W2057974767","https://openalex.org/W2064147138","https://openalex.org/W2079278135","https://openalex.org/W2099461641","https://openalex.org/W2105088727","https://openalex.org/W2112058494","https://openalex.org/W2118639405","https://openalex.org/W2121638441","https://openalex.org/W2130956934","https://openalex.org/W2143863355","https://openalex.org/W2183481184","https://openalex.org/W2294586855","https://openalex.org/W2502170570","https://openalex.org/W2611804663","https://openalex.org/W2896902984","https://openalex.org/W2912091644","https://openalex.org/W2951888513","https://openalex.org/W3106992008","https://openalex.org/W4205585032","https://openalex.org/W4251495539","https://openalex.org/W4300076045","https://openalex.org/W6603231382"],"related_works":["https://openalex.org/W3017736765","https://openalex.org/W193468460","https://openalex.org/W2140496876","https://openalex.org/W4294706475","https://openalex.org/W4293570283","https://openalex.org/W2216231335","https://openalex.org/W3108299327","https://openalex.org/W4200133467","https://openalex.org/W4389463731","https://openalex.org/W2363855676"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}