Author:
Baveja Alok,Srinivasan Aravind
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference5 articles.
1. A. Baveja, A. Srinivasan, Approximation algorithms for disjoint paths and related routing and packing problems, Math. Oper. Res., to appear
2. Clique is hard to approximate within n1−ϵ;Håstad,1996
3. Probability inequalities for sums of bounded random variables;Hoeffding;Amer. Statist. Assoc. J.,1953
4. Approximation algorithms for disjoint paths problems;Kleinberg,1996
5. Approximating disjoint-path problems using greedy algorithms and packing integer programs;Kolliopoulos,1998
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献