2019 - ACM Distinguished Member
2009 - Fellow of Alfred P. Sloan Foundation
His scientific interests lie mostly in Mathematical optimization, Approximation algorithm, Facility location problem, Distributed computing and Wireless sensor network. His Mathematical optimization research includes elements of Computational complexity theory and Metric. His study in Approximation algorithm is interdisciplinary in nature, drawing from both Linear programming and Markov process.
He focuses mostly in the field of Facility location problem, narrowing it down to topics relating to Network planning and design and, in certain cases, Steiner tree problem. The concepts of his Distributed computing study are interwoven with issues in Theoretical computer science, Data stream mining, Data transmission and Query optimization. His Wireless sensor network research is multidisciplinary, relying on both Key distribution in wireless sensor networks, Visual sensor network, Mobile wireless sensor network and Data mining.
Kamesh Munagala mainly focuses on Mathematical optimization, Approximation algorithm, Mathematical economics, Wireless sensor network and Common value auction. His research in the fields of Facility location problem and Optimization problem overlaps with other disciplines such as Rounding. The various areas that Kamesh Munagala examines in his Approximation algorithm study include Decision theory, Markov process and Greedy algorithm.
His biological study spans a wide range of topics, including Complement and Bayesian probability. His work carried out in the field of Wireless sensor network brings together such families of science as Key distribution in wireless sensor networks, Distributed computing and Data mining. His research in Common value auction focuses on subjects like Incentive compatibility, which are connected to Budget constraint.
The scientist’s investigation covers issues in Mathematical economics, Constant, Upper and lower bounds, Combinatorics and Mathematical optimization. His Mathematical economics study combines topics from a wide range of disciplines, such as Common value auction, Lottery and Bayesian probability. The Upper and lower bounds study combines topics in areas such as Matching and Approximation algorithm.
His research in Approximation algorithm intersects with topics in Facility location problem, Optimization problem, Market segmentation and Dynamic pricing. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Resource allocation, Metric, Distortion, Metric space and Sequence. His studies deal with areas such as Time complexity, Dynamic programming and Cluster analysis as well as Metric space.
Kamesh Munagala mainly focuses on Social choice theory, Proportionally fair, Cluster analysis, Ranking and Mathematical economics. His biological study spans a wide range of topics, including Metric, Distortion, Mathematical optimization, Metric space and Preference. His Metric space research incorporates elements of Ordinal number, Measure and Constraint.
His Proportionally fair research includes themes of Discrete mathematics and Statistics. His Ranking research is multidisciplinary, incorporating perspectives in Stability, Core and Approximation algorithm, Combinatorics. His study brings together the fields of Convergence and Mathematical economics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Local Search Heuristics for k -Median and Facility Location Problems
Vijay Arya;Naveen Garg;Rohit Khandekar;Adam Meyerson.
SIAM Journal on Computing (2004)
Local Search Heuristics for k -Median and Facility Location Problems
Vijay Arya;Naveen Garg;Rohit Khandekar;Adam Meyerson.
SIAM Journal on Computing (2004)
Local search heuristic for k-median and facility location problems
Vijay Arya;Naveen Garg;Rohit Khandekar;Adam Meyerson.
symposium on the theory of computing (2001)
Local search heuristic for k-median and facility location problems
Vijay Arya;Naveen Garg;Rohit Khandekar;Adam Meyerson.
symposium on the theory of computing (2001)
Cost-Distance: Two Metric Network Design
Adam Meyerson;Kamesh Munagala;Serge Plotkin.
SIAM Journal on Computing (2008)
Cost-Distance: Two Metric Network Design
Adam Meyerson;Kamesh Munagala;Serge Plotkin.
SIAM Journal on Computing (2008)
Adaptive ordering of pipelined stream filters
Shivnath Babu;Rajeev Motwani;Kamesh Munagala;Itaru Nishizawa.
international conference on management of data (2004)
Adaptive ordering of pipelined stream filters
Shivnath Babu;Rajeev Motwani;Kamesh Munagala;Itaru Nishizawa.
international conference on management of data (2004)
Approximation algorithms for restless bandit problems
Sudipto Guha;Kamesh Munagala;Peng Shi.
Journal of the ACM (2010)
Approximation algorithms for restless bandit problems
Sudipto Guha;Kamesh Munagala;Peng Shi.
Journal of the ACM (2010)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Pennsylvania
Stanford University
Duke University
Duke University
Stanford University
Duke University
Duke University
Stanford University
University of Pennsylvania
University of Pittsburgh
University of Ioannina
Australian National University
Lancaster University
Harvard University
University of Cologne
University of Barcelona
Delft University of Technology
University of Helsinki
University of Alaska Fairbanks
Aarhus University
University of Zurich
Université Catholique de Louvain
University of Avignon
Stanford University
Norwegian School of Sport Sciences
Carnegie Endowment for International Peace