Author:
Bhattacharya Sayan,Henzinger Monika,Italiano Giuseppe
Funder
European Research Council
ERC
EU 7th Framework Programme
MIUR
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference19 articles.
1. The Hungarian method for the assignment problem;Kuhn;Nav. Res. Logist. Q.,1955
2. A primal-dual algorithm for linear programs;Dantzig,1956
3. A linear time approximation algorithm for the weighted vertex cover problem;Bar-Yehuda;J. Algorithms,1981
4. A general approximation technique for constrained forest problems;Goemans;SIAM J. Comput.,1992
5. The primal-dual method for approximation algorithms and its application to network design problems;Goemans,1997
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover;SIAM Journal on Computing;2023-10-06
2. Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide;ACM Journal of Experimental Algorithmics;2022-12-13
3. Input-Dynamic Distributed Algorithms for Communication Networks;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2021-02-18
4. Rounding dynamic matchings against an adaptive adversary;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
5. Near-optimal fully dynamic densest subgraph;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06