| Year |
Citation |
Score |
| 2020 |
Hassin R, Ravi R, Salman FS, Segev D. The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures Algorithmica. 82: 2474-2501. DOI: 10.1007/S00453-020-00693-8 |
0.484 |
|
| 2019 |
Sidiropoulos A, Badoiu M, Dhamdhere K, Gupta A, Indyk P, Rabinovich Y, Racke H, Ravi R. Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces Siam Journal On Discrete Mathematics. 33: 454-473. DOI: 10.1137/17M1113527 |
0.4 |
|
| 2019 |
Jiao Y, Ravi R, Gatterbauer W. Algorithms for automatic ranking of participants and tasks in an anonymized contest Theoretical Computer Science. 789: 64-76. DOI: 10.1016/J.Tcs.2018.07.014 |
0.306 |
|
| 2019 |
Haddadan A, Newman A, Ravi R. Shorter tours and longer detours: Uniform covers and a bit beyond Mathematical Programming. 1-29. DOI: 10.1007/S10107-019-01426-8 |
0.473 |
|
| 2017 |
Gupta A, Nagarajan V, Ravi R. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems Mathematics of Operations Research. 42: 876-896. DOI: 10.1287/Moor.2016.0831 |
0.481 |
|
| 2017 |
Hassin R, Ravi R, Salman FS. Multiple facility location on a network with linear reliability order of edges Journal of Combinatorial Optimization. 34: 931-955. DOI: 10.1007/S10878-017-0121-5 |
0.496 |
|
| 2015 |
Gupta A, Krishnaswamy R, Nagarajan V, Ravi R. Running Errands in Time: Approximation Algorithms for Stochastic Orienteering Mathematics of Operations Research. 40: 56-79. DOI: 10.1287/Moor.2014.0656 |
0.472 |
|
| 2015 |
Gørtz IL, Nagarajan V, Ravi R. Minimum Makespan Multi-Vehicle Dial-a-Ride Acm Transactions On Algorithms. 11: 23. DOI: 10.1145/2629653 |
0.416 |
|
| 2015 |
Karp JA, Ravi R. A 97-approximation algorithm for Graphic TSP in cubic bipartite graphs Discrete Applied Mathematics. DOI: 10.1016/j.dam.2015.10.038 |
0.349 |
|
| 2014 |
Molinaro M, Ravi R. The geometry of online packing linear programs Mathematics of Operations Research. 39: 46-59. DOI: 10.1287/Moor.2013.0612 |
0.373 |
|
| 2014 |
Karp JA, Ravi R. A 9/7-Approximation algorithm for graphic TSP in cubic bipartite graphs Leibniz International Proceedings in Informatics, Lipics. 28: 284-296. DOI: 10.1016/J.Dam.2015.10.038 |
0.455 |
|
| 2014 |
Oertel D, Ravi R. Complexity of transmission network expansion planning NP-hardness of connected networks and MINLP evaluation Energy Systems. 5: 179-207. DOI: 10.1007/S12667-013-0091-3 |
0.371 |
|
| 2014 |
Gupta A, Könemann J, Leonardi S, Ravi R, Schäfer G. Efficient cost-sharing mechanisms for prize-collecting problems Mathematical Programming. 152: 147-188. DOI: 10.1007/S10107-014-0781-1 |
0.455 |
|
| 2014 |
Golovin D, Goyal V, Polishchuk V, Ravi R, Sysikaski M. Improved approximations for two-stage min-cut and shortest path problems under uncertainty Mathematical Programming. 149: 167-194. DOI: 10.1007/S10107-013-0742-0 |
0.514 |
|
| 2014 |
Gupta A, Nagarajan V, Ravi R. Thresholded covering algorithms for robust and max---min optimization Mathematical Programming. 146: 583-615. DOI: 10.1007/S10107-013-0705-5 |
0.416 |
|
| 2014 |
Grandoni F, Ravi R, Singh M, Zenklusen R. New approaches to multi-objective optimization Mathematical Programming. 146: 525-554. DOI: 10.1007/S10107-013-0703-7 |
0.459 |
|
| 2014 |
Nikzad A, Ravi R. Sending secrets swiftly: Approximation algorithms for generalized multicast problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8573: 568-607. DOI: 10.1007/978-3-662-43951-7_48 |
0.476 |
|
| 2013 |
Iwata S, Ravi R. Approximating max-min weighted T-joins Operations Research Letters. 41: 321-324. DOI: 10.1016/J.Orl.2013.03.004 |
0.424 |
|
| 2013 |
Goyal V, Ravi R. An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set Operations Research Letters. 41: 191-196. DOI: 10.1016/J.Orl.2013.01.004 |
0.461 |
|
| 2012 |
Rajasekar R, Ravi R, Shekhar B. Performance analysis of rejection ratio in cost optimized virtual private networks provisioning algorithm (COVPA) using Waxman and Barabasi model in cyber space Journal of Computer Science. 8: 239-242. DOI: 10.3844/jcssp.2012.239.242 |
0.321 |
|
| 2012 |
Gupta A, Nagarajan V, Ravi R. Technical Note---Approximation Algorithms for VRP with Stochastic Demands Operations Research. 60: 123-127. DOI: 10.1287/Opre.1110.0967 |
0.467 |
|
| 2012 |
Fukunaga T, Ravi R. Iterative rounding approximation algorithms for degree-bounded node-connectivity network design Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 263-272. DOI: 10.1137/13094503X |
0.507 |
|
| 2012 |
Gupta A, Krishnaswamy R, Ravi R. Online and Stochastic Survivable Network Design Siam Journal On Computing. 41: 1649-1672. DOI: 10.1137/09076725X |
0.518 |
|
| 2012 |
Nagarajan V, Ravi R. Approximation algorithms for distance constrained vehicle routing problems Networks. 59: 209-214. DOI: 10.1002/Net.20435 |
0.51 |
|
| 2011 |
Misra N, Blelloch G, Ravi R, Schwartz R. An optimization-based sampling scheme for phylogenetic trees. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 18: 1599-609. PMID 21951054 DOI: 10.1089/Cmb.2011.0164 |
0.326 |
|
| 2011 |
Misra N, Blelloch G, Ravi R, Schwartz R. Generalized buneman pruning for inferring the most parsimonious multi-state phylogeny. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 18: 445-57. PMID 21385046 DOI: 10.1089/cmb.2010.0254 |
0.43 |
|
| 2011 |
Tsai MC, Blelloch G, Ravi R, Schwartz R. A consensus tree approach for reconstructing human evolutionary history and detecting population substructure. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 8: 918-28. PMID 21282863 DOI: 10.1109/Tcbb.2011.23 |
0.325 |
|
| 2011 |
Gørtz IL, Molinaro M, Nagarajan V, Ravi R. Capacitated vehicle routing with non-uniform speeds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6655: 235-247. DOI: 10.1287/Moor.2015.0729 |
0.457 |
|
| 2011 |
Gupta A, Pál M, Ravi R, Sinha A. Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems Siam Journal On Computing. 40: 1361-1401. DOI: 10.1137/080732250 |
0.503 |
|
| 2011 |
Goyal V, Genc-Kaya L, Ravi R. An FPTAS for minimizing the product of two non-negative linear cost functions Mathematical Programming. 126: 401-405. DOI: 10.1007/S10107-009-0287-4 |
0.44 |
|
| 2011 |
Nagarajan V, Ravi R. The directed orienteering problem Algorithmica (New York). 60: 1017-1030. DOI: 10.1007/S00453-011-9509-2 |
0.482 |
|
| 2010 |
Gupta A, Hajiaghayi M, Nagarajan V, Ravi R. Dial a Ride from k -forest Acm Transactions On Algorithms. 6: 41. DOI: 10.1145/1721837.1721857 |
0.442 |
|
| 2010 |
Ravi R, Sinha A. Approximation algorithms for multicommodity facility location pro blems Siam Journal On Discrete Mathematics. 24: 538-551. DOI: 10.1137/080732857 |
0.509 |
|
| 2010 |
Gupta A, Nagarajan V, Ravi R. An improved approximation algorithm for requirement cut Operations Research Letters. 38: 322-325. DOI: 10.1016/J.Orl.2010.02.009 |
0.451 |
|
| 2010 |
Nagarajan V, Ravi R, Singh M. Simpler analysis of LP extreme points for traveling salesman and survivable network design problems Operations Research Letters. 38: 156-160. DOI: 10.1016/J.Orl.2010.02.005 |
0.426 |
|
| 2010 |
Goyal V, Ravi R. A PTAS for the chance-constrained knapsack problem with random item sizes Operations Research Letters. 38: 161-164. DOI: 10.1016/J.Orl.2010.01.003 |
0.425 |
|
| 2010 |
Yildiz H, Ravi R, Fairey W. Integrated optimization of customer and supplier logistics at Robert Bosch LLC European Journal of Operational Research. 207: 456-464. DOI: 10.1016/J.Ejor.2010.03.044 |
0.31 |
|
| 2010 |
Nagarajan V, Ravi R. Approximation algorithms for requirement cut on graphs Algorithmica (New York). 56: 198-213. DOI: 10.1007/S00453-008-9171-5 |
0.491 |
|
| 2010 |
Gupta A, Krishnaswamy R, Ravi R. Tree embeddings for two-edge-connected network design Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1521-1538. |
0.355 |
|
| 2009 |
Ravi R. Iterative methods in combinatorial optimization Leibniz International Proceedings in Informatics, Lipics. 4: 453-469. DOI: 10.4230/LIPIcs.FSTTCS.2009.2339 |
0.339 |
|
| 2008 |
Sridhar S, Lam F, Blelloch GE, Ravi R, Schwartz R. Mixed integer linear programming for maximum-parsimony phylogeny inference. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 5: 323-31. PMID 18670037 DOI: 10.1109/Tcbb.2008.26 |
0.436 |
|
| 2008 |
Lancia G, Ravi R, Rizzi R. Haplotyping for Disease Association: A Combinatorial Approach Ieee/Acm Transactions On Computational Biology and Bioinformatics. 5: 245-251. PMID 18451433 DOI: 10.1109/Tcbb.2007.70255 |
0.318 |
|
| 2008 |
Salman S, Ravi R, Hooker JN. Solving the capacitated local access network design problem Informs Journal On Computing. 20: 243-254. DOI: 10.1287/Ijoc.1070.0237 |
0.54 |
|
| 2008 |
Ravi R, Sinha A. Approximating k-cuts using network strength as a Lagrangean relaxation European Journal of Operational Research. 186: 77-90. DOI: 10.1016/J.Ejor.2007.01.040 |
0.534 |
|
| 2008 |
Nagarajan V, Ravi R. The directed minimum latency problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5171: 193-206. DOI: 10.1007/978-3-540-85363-3_16 |
0.411 |
|
| 2007 |
Sridhar S, Lam F, Blelloch GE, Ravi R, Schwartz R. Direct maximum parsimony phylogeny reconstruction from genotype data. Bmc Bioinformatics. 8: 472. PMID 18053244 DOI: 10.1186/1471-2105-8-472 |
0.318 |
|
| 2007 |
Sridhar S, Dhamdhere K, Blelloch G, Halperin E, Ravi R, Schwartz R. Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 4: 561-71. PMID 17975268 DOI: 10.1109/Tcbb.2007.1070 |
0.45 |
|
| 2007 |
Gupta A, Ravi R, Sinha A. LP Rounding Approximation Algorithms for Stochastic Network Design Mathematics of Operations Research. 32: 345-364. DOI: 10.1287/Moor.1060.0237 |
0.487 |
|
| 2007 |
Frieze A, Kleinberg J, Ravi R, Debany W. Line-of-sight networks Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 968-977. DOI: 10.1017/S0963548308009334 |
0.422 |
|
| 2007 |
Nagarajan V, Ravi R. Poly-logarithmic approximation algorithms for directed vehicle routing problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4627: 257-270. |
0.394 |
|
| 2006 |
Ravi R, Sinha A. Approximation algorithms for problems combining facility location and network design Operations Research. 54: 73-81. DOI: 10.1287/Opre.1050.0228 |
0.501 |
|
| 2006 |
Dhamdhere K, Gupta A, Ravi R. Approximation Algorithms for Minimizing Average Distortion Theory of Computing Systems \/ Mathematical Systems Theory. 39: 93-111. DOI: 10.1007/S00224-005-1259-6 |
0.408 |
|
| 2006 |
Ravi R, Singh M. Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 169-180. DOI: 10.1007/11786986_16 |
0.434 |
|
| 2006 |
Ravi R. Matching based augmentations for approximating connectivity problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3887: 13-24. DOI: 10.1007/11682462_4 |
0.438 |
|
| 2006 |
Nagarajan V, Ravi R. Minimum vehicle routing with a common deadline Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4110: 212-223. |
0.416 |
|
| 2005 |
Könemann J, Ravi R. Primal-dual meets local search: Approximating MSTs with nonuniform degree bounds Siam Journal On Computing. 34: 763-773. DOI: 10.1137/S0097539702418048 |
0.401 |
|
| 2004 |
Even G, Garg N, KöNemann J, Ravi R, Sinha A. Min-max tree covers of graphs Operations Research Letters. 32: 309-315. DOI: 10.1016/J.Orl.2003.11.010 |
0.505 |
|
| 2004 |
Dahlhaus E, Dankelmann P, Ravi R. A linear-time algorithm to compute a MAD tree of an interval graph Information Processing Letters. 89: 255-259. DOI: 10.1016/J.Ipl.2003.11.009 |
0.437 |
|
| 2004 |
Ravi R, Sinha A. Hedging uncertainty: Approximation algorithms for stochastic optimization problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3064: 101-115. DOI: 10.1007/S10107-005-0673-5 |
0.505 |
|
| 2004 |
Klein PN, Krishnan R, Raghavachari B, Ravi R. Approximation algorithms for finding low-degree subgraphs Networks. 44: 203-215. DOI: 10.1002/Net.20031 |
0.503 |
|
| 2004 |
Ravi R, Sinha A. Multicommodity Facility Location Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 335-342. |
0.361 |
|
| 2003 |
Könemann J, Ravi R. Primal-dual meets local search: Approximating MST's with nonuniform degree bounds Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 389-395. DOI: 10.1137/S0097539702418048 |
0.518 |
|
| 2003 |
Conforti M, Hassin R, Ravi R. Reconstructing edge-disjoint paths Operations Research Letters. 31: 273-276. DOI: 10.1016/S0167-6377(03)00022-1 |
0.395 |
|
| 2003 |
Bontridder dKMJ, Halldórsson BV, Halldórsson MM, Hurkens C, Lenstra JK, Ravi R, Stougie L. Approximation algorithms for the test cover problem Mathematical Programming. 98: 477-491. DOI: 10.1007/S10107-003-0414-6 |
0.475 |
|
| 2003 |
Könemann J, Ravi R. Quasi-polynomial time approximation algorithm for low-degree minimum-cost steiner trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2914: 289-301. |
0.408 |
|
| 2002 |
Könemann J, Ravi R. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees Siam Journal On Computing. 31: 1783-1793. DOI: 10.1137/S009753970036917X |
0.426 |
|
| 2002 |
Konjevod G, Ravi R, Srinivasan A. Approximation Algorithms for the Covering Steiner Problem Random Structures and Algorithms. 20: 465-482. DOI: 10.1002/Rsa.10038 |
0.528 |
|
| 2002 |
Ravi R, Sinha A. Integrated logistics: Approximation algorithms combining facility location and network design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2337: 212-229. |
0.408 |
|
| 2001 |
Konjevod G, Ravi R, Salman FS. On approximating planar metrics by tree metrics Information Processing Letters. 80: 213-219. DOI: 10.1016/S0020-0190(01)00161-2 |
0.418 |
|
| 2001 |
Ravi R, Marathe MV, Ravi SS, Rosenkrantz DJ, Hunt HB. Approximation algorithms for degree-constrained minimum-cost network-design problems Algorithmica (New York). 31: 58-78. DOI: 10.1007/S00453-001-0038-2 |
0.487 |
|
| 2000 |
Salman FS, Cheriyan J, Ravi R, Subramanian S. Approximating the single-sink link-installation problem in network design Siam Journal On Optimization. 11: 595-610. DOI: 10.1137/S1052623497321432 |
0.55 |
|
| 2000 |
Konemann J, Ravi R. Matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 537-546. DOI: 10.1137/S009753970036917X |
0.512 |
|
| 2000 |
Dawande M, Kalagnanam J, Keskinocak P, Ravi R, Salman FS. Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions Journal of Combinatorial Optimization. 4: 171-186. DOI: 10.1023/A:1009894503716 |
0.502 |
|
| 2000 |
Blum A, Konjevod G, Ravi R, Vempala S. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems Theoretical Computer Science. 235: 25-42. DOI: 10.1016/S0304-3975(99)00181-4 |
0.442 |
|
| 2000 |
Hassin R, Ravi R, Salman FS. Approximation algorithms for a capacitated network design problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1913: 167-176. DOI: 10.1007/S00453-003-1069-7 |
0.519 |
|
| 2000 |
Hassin R, Ravi R, Salman FS. Approximation algorithms for a capacitated network design problem Lecture Notes in Computer Science. 167-176. DOI: 10.1007/3-540-44436-X_17 |
0.519 |
|
| 2000 |
Garg N, Konjevod G, Ravi R. A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem Journal of Algorithms. 37: 66-84. DOI: 10.1006/Jagm.2000.1096 |
0.527 |
|
| 2000 |
Konjevod G, Ravi R. Approximation algorithm for the covering Steiner problem Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 338-344. |
0.432 |
|
| 1999 |
Krumke SO, Noltemeier H, Wirth H, Marathe MV, Ravi R, Ravi SS, Sundaram R. Improving spanning trees by upgrading nodes Theoretical Computer Science. 221: 139-155. DOI: 10.1016/S0304-3975(99)00030-4 |
0.475 |
|
| 1999 |
Ravi R, Salman FS. Approximation algorithms for the traveling purchaser problem and its variants in network design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1643: 29-40. DOI: 10.1007/3-540-48481-7_4 |
0.415 |
|
| 1999 |
Blum A, Ravi R, Vempala S. A Constant-Factor Approximation Algorithm for thek-MST Problem Journal of Computer and System Sciences. 58: 101-108. DOI: 10.1006/Jcss.1997.1542 |
0.543 |
|
| 1999 |
Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS, Sundaram R, Wirth H-. Improving Minimum Cost Spanning Trees by Upgrading Nodes Journal of Algorithms. 33: 92-111. DOI: 10.1006/Jagm.1999.1021 |
0.531 |
|
| 1998 |
Stelling PF, Martel CU, Oklobdzija VG, Ravi R. Optimal circuits for parallel multipliers Ieee Transactions On Computers. 47: 273-285. DOI: 10.1109/12.660163 |
0.338 |
|
| 1998 |
Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS. Approximation Algorithms for Certain Network Improvement Problems Journal of Combinatorial Optimization. 2: 257-288. DOI: 10.1023/A:1009798010579 |
0.491 |
|
| 1998 |
Ravi R, Kececioglu JD. Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree Discrete Applied Mathematics. 88: 355-366. DOI: 10.1016/S0166-218X(98)00079-1 |
0.422 |
|
| 1998 |
Chaudhuri S, Garg N, Ravi R. The p -neighbor k -center problem Information Processing Letters. 65: 131-134. DOI: 10.1016/S0020-0190(97)00224-X |
0.474 |
|
| 1998 |
Carr R, Ravi R. A new bound for the 2-edge connected subgraph problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1412: 112-125. DOI: 10.1007/3-540-69346-7_9 |
0.339 |
|
| 1998 |
Lu HI, Ravi R. Approximating Maximum Leaf Spanning Trees in Almost Linear Time Journal of Algorithms. 29: 132-141. DOI: 10.1006/Jagm.1998.0944 |
0.463 |
|
| 1998 |
Marathe MV, Ravi R, Sundaram R, Ravi SS, Rosenkrantz DJ, Hunt HB. Bicriteria Network Design Problems Journal of Algorithms. 28: 142-171. DOI: 10.1006/Jagm.1998.0930 |
0.546 |
|
| 1997 |
Ravi R, Williamson DP. An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems Algorithmica (New York). 18: 21-43. DOI: 10.1007/Bf02523686 |
0.551 |
|
| 1996 |
Ravi R, Sundaram R, Marathe MV, Rosenkrantz DJ, Ravi SS. Spanning Trees---Short or Small Siam Journal On Discrete Mathematics. 9: 178-200. DOI: 10.1137/S0895480194266331 |
0.522 |
|
| 1996 |
Bafna V, Narayanan B, Ravi R. Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) Discrete Applied Mathematics. 71: 41-53. DOI: 10.1016/S0166-218X(96)00063-7 |
0.446 |
|
| 1996 |
Marathe MV, Ravi R, Sundaram R. Service-constrained network design problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1097: 28-40. |
0.42 |
|
| 1996 |
Ravi R, Goemans MX. The constrained minimum spanning tree problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1097: 66-75. |
0.389 |
|
| 1996 |
Blum A, Ravi R, Vempala S. Constant-factor approximation algorithm for the k-MST problem Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 442-448. |
0.431 |
|
| 1995 |
Agrawal A, Klein P, Ravi R. When trees collide: an approximation algorithm for the generalized steiner problem on networks Siam Journal On Computing. 24: 440-456. DOI: 10.1137/S0097539792236237 |
0.487 |
|
| 1995 |
Klein P, Ravi R. A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees Journal of Algorithms. 19: 104-115. DOI: 10.1006/Jagm.1995.1029 |
0.508 |
|
| 1994 |
Ravi R. A primal-dual approximation algorithm for the Steiner forest problem Information Processing Letters. 50: 185-189. DOI: 10.1016/0020-0190(94)00034-4 |
0.511 |
|
| 1992 |
Marathe MV, Ravi R, Pandu Rangan C. Generalized vertex covering in interval graphs Discrete Applied Mathematics. 39: 87-93. DOI: 10.1016/0166-218X(92)90116-R |
0.482 |
|
| 1992 |
Ravi R, Marathe MV, Pandu Rangan C. An optimal algorithm to solve the all-pair shortest path problem on interval graphs Networks. 22: 21-35. DOI: 10.1002/Net.3230220103 |
0.525 |
|
| Show low-probability matches. |