{"doi":"10.1006/jagm.1993.1026","title":"Online Weighted Matching","abstract":null,"journal":"Journal of Algorithms","year":1993,"id":588952,"datarank":13.30043731622632,"base_score":5.231108616854587,"endowment":5.231108616854587,"self_citation_contribution":0.7846662925281881,"citation_network_contribution":12.515771023698132,"self_endowment_contribution":0.7846662925281881,"citer_contribution":12.515771023698132,"corpus_percentile":null,"corpus_rank":null,"citation_count":186,"citer_count":172,"citers_with_citation_signal":135,"citers_with_endowment":135,"datacite_reuse_total":5,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1506825,"name":"K. Pruhs","orcid":null,"position":1,"is_corresponding":false},{"id":1506824,"name":"B. Kalyanasundaram","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Online Weighted Matching","abstract":null,"is_dataset_classified":null,"base_score":5.231108616854587,"endowment":5.231108616854587,"datacite_reuse_total":5,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"26657633","pmcid":null,"openalex_id":"https://openalex.org/W1978382073","authors":[],"funders":[],"total_grants":0,"fwci":2.8498,"citation_percentile":0.90336317,"influential_citations":0,"citation_trend":[{"year":2012,"count":11},{"year":2013,"count":3},{"year":2014,"count":5},{"year":2015,"count":7},{"year":2016,"count":9},{"year":2017,"count":8},{"year":2018,"count":15},{"year":2019,"count":14},{"year":2020,"count":11},{"year":2021,"count":13},{"year":2022,"count":11},{"year":2023,"count":12},{"year":2024,"count":6},{"year":2025,"count":5},{"year":2026,"count":2}],"oa_status":"closed","license":"https://www.elsevier.com/tdm/userlicense/1.0/","oa_locations":[{"url":"https://api.elsevier.com/content/article/PII:S0196677483710266?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0196677483710266?httpAccept=text/plain","host_type":"publisher"},{"url":"https://doi.org/10.1006/jagm.1993.1026","host_type":"journal"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.2873","host_type":""}],"fields_of_study":["Optimization and Search Problems","Complexity and Algorithms in Graphs","Cryptography and Data Security"],"mesh_terms":[],"keywords":["Matching (statistics)","Bipartite graph","Online algorithm","Greedy algorithm","Competitive analysis","Optimal matching","Metric (unit)","Simple (philosophy)","Mathematics","3-dimensional matching","Contrast (vision)","Mathematical optimization","Combinatorics","Algorithm","Computer science","Blossom algorithm","Upper and lower bounds","Artificial intelligence","Statistics"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.itcs.2026.94","title":"Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2025.94","title":"A Nearly Optimal Deterministic Algorithm for Online Transportation Problem","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.swat.2022.30","title":"A Scalable Work Function Algorithm for the k-Server Problem","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.approx/random.2020.40","title":"Permutation Strikes Back: The Power of Recourse in Online Metric Matching","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.approx-random.2019.10","title":"Dynamic Pricing of Servers on Trees","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-23T08:19:22.838950Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}