BibSLEIGH — R

Travelled to:

1 × Denmark
1 × France
1 × Hungary
1 × Spain
1 × United Kingdom
2 × Italy
8 × USA

Collaborated with:

A.Gupta J.Könemann M.Singh V.Nagarajan A.Agrawal P.N.Klein A.Blum S.Vempala M.V.Marathe S.S.Ravi A.Nikzad M.Molinaro D.J.Rosenkrantz H.B.H.III R.Krishnaswamy R.Sundaram N.Buchbinder J.Naor M.Pál A.Sinha G.Konjevod G.E.Blelloch K.Dhamdhere E.Halperin R.Schwartz S.Sridhar S.O.Krumke H.Noltemeier H.Wirth

Talks about:

approxim (11) algorithm (10) problem (7) tree (5) degre (4) network (3) minimum (3) optim (3) onlin (3) stochast (2)

Person: R. Ravi

DBLP: Ravi:R=

Contributed to:

2014

2012

2010

2009

2006

2004

2003

2000

1998

1997

1996

1995

1993

1991

Wrote 18 papers:

ICALP-v2-2014-NikzadR #algorithm #approximate #multi #problem: Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (AN, RR), pp. 568–607.
ICALP-v1-2012-BuchbinderNRS #algorithm #approximate #constraints #online #rank: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.
ICALP-v1-2012-MolinaroR #geometry #linear #online #source code: Geometry of Online Packing Linear Programs (MM, RR), pp. 701–713.
ICALP-v1-2010-GuptaNR #algorithm #optimisation #robust: Thresholded Covering Algorithms for Robust and Max-min Optimization (AG, VN, RR), pp. 262–274.
ICALP-v1-2010-GuptaNR10a #adaptation #algorithm #approximate #problem: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
STOC-2009-GuptaKR #design #network #online #probability: Online and stochastic survivable network design (AG, RK, RR), pp. 685–694.
ICALP-v1-2006-BlellochDHRSS #parametricity #re-engineering: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (GEB, KD, EH, RR, RS, SS), pp. 667–678.
ICALP-v1-2006-RaviS #algorithm #approximate: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.
STOC-2004-GuptaPRS #algorithm #approximate #optimisation #probability: Boosted sampling: approximation algorithms for stochastic optimization (AG, MP, RR, AS), pp. 417–426.
STOC-2003-KonemannR #approximate #bound: Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.
STOC-2000-KonemannR #algorithm #approximate #bound #matter: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
STOC-1998-BlumKRV #problem: Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems (AB, GK, RR, SV), pp. 100–105.
ICALP-1997-KrumkeMNRRSW: Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.
STOC-1996-BlumRV #algorithm #approximate #problem: A Constant-factor Approximation Algorithm for the k MST Problem (AB, RR, SV), pp. 442–448.
ICALP-1995-MaratheRSRRH #design #network #problem: Bicriteria Network Design Problems (MVM, RR, RS, SSR, DJR, HBHI), pp. 487–498.
STOC-1993-RaviMRRH #algorithm #approximate #multi: Many birds with one stone: multi-objective approximation algorithms (RR, MVM, SSR, DJR, HBHI), pp. 438–447.
ICALP-1991-RaviAK #approximate #graph #problem #scheduling: Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.
STOC-1991-AgrawalKR #algorithm #approximate #network #problem: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (AA, PNK, RR), pp. 134–144.