{"id":"https://openalex.org/W1617753329","doi":"https://doi.org/10.1007/978-3-662-48350-3_23","title":"Sublinear Estimation of Weighted Matchings in Dynamic Data Streams","display_name":"Sublinear Estimation of Weighted Matchings in Dynamic Data Streams","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1617753329","doi":"https://doi.org/10.1007/978-3-662-48350-3_23","mag":"1617753329"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-48350-3_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48350-3_23","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":"conference-paper","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/A5016911982","display_name":"Marc Bury","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc Bury","raw_affiliation_strings":["Efficient Algorithms and Complexity Theory, TU\u00a0Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Efficient Algorithms and Complexity Theory, TU\u00a0Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080748807","display_name":"Chris Schwiegelshohn","orcid":"https://orcid.org/0000-0002-1202-0805"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Chris Schwiegelshohn","raw_affiliation_strings":["Efficient Algorithms and Complexity Theory, TU\u00a0Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Efficient Algorithms and Complexity Theory, TU\u00a0Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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/sublinear-function","display_name":"Sublinear function","score":0.7394218444824219},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.605023980140686},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5927025079727173},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5589938163757324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.503947913646698},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4927668869495392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47918832302093506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4345479905605316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35292166471481323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.343344122171402},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12258574366569519}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7394218444824219},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.605023980140686},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5927025079727173},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5589938163757324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.503947913646698},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4927668869495392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47918832302093506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4345479905605316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35292166471481323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.343344122171402},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12258574366569519},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-48350-3_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48350-3_23","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"},{"id":"pmh:oai:iris.uniroma1.it:11573/1085843","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/1085843","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W57330","https://openalex.org/W15553240","https://openalex.org/W176067329","https://openalex.org/W1485490327","https://openalex.org/W1498807656","https://openalex.org/W1501443715","https://openalex.org/W1514707655","https://openalex.org/W1592346261","https://openalex.org/W1595640791","https://openalex.org/W1618327071","https://openalex.org/W1639030016","https://openalex.org/W1761167196","https://openalex.org/W1871809785","https://openalex.org/W1943900259","https://openalex.org/W1962032444","https://openalex.org/W1982991092","https://openalex.org/W1985061810","https://openalex.org/W1997010704","https://openalex.org/W2003425214","https://openalex.org/W2016289973","https://openalex.org/W2023492687","https://openalex.org/W2040813148","https://openalex.org/W2053182026","https://openalex.org/W2059867647","https://openalex.org/W2122929038","https://openalex.org/W2165753192","https://openalex.org/W2225286048","https://openalex.org/W2242407666","https://openalex.org/W2272441262","https://openalex.org/W2295466155","https://openalex.org/W2611754984","https://openalex.org/W2762990162","https://openalex.org/W2952341094","https://openalex.org/W3021537373","https://openalex.org/W3101104511","https://openalex.org/W4230889046","https://openalex.org/W4234540089","https://openalex.org/W4237171398","https://openalex.org/W4239886656","https://openalex.org/W4252630569","https://openalex.org/W4253094038"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2809723425","https://openalex.org/W2052708136","https://openalex.org/W2005302727","https://openalex.org/W3082028334","https://openalex.org/W4289097813","https://openalex.org/W4321153757","https://openalex.org/W2906263995"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}