Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference51 articles.
1. Robust assignments via ear decompositions and randomized rounding;Adjiashvili,2016
2. Robust assignments with vulnerable nodes;Adjiashvili,2017
3. M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. Ho, M. Naor, E. Szémeredi, Fault tolerant graphs, perfect hash functions and disjoint paths, in: IEEE Symposium on Foundations of Computer Science (FOCS 1992), 1992, pp. 693–702.
4. Explicit construction of linear sized tolerant networks;Alon;Discrete Math.,1988
5. An Introduction To Diophantine Equations;Andreescu,2010
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献