Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity
From MaRDI portal
Publication:4554339
DOI10.1145/3168008zbMath1454.68095MaRDI QIDQ4554339
Fei Chen, T.-H. Hubert Chan, Xiaowei Wu
Publication date: 13 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3168008
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
