{"id":21,"date":"2020-05-02T15:33:31","date_gmt":"2020-05-02T15:33:31","guid":{"rendered":"https:\/\/wordpress.cs.vt.edu\/algorithms\/?page_id=21"},"modified":"2022-06-27T01:05:16","modified_gmt":"2022-06-27T01:05:16","slug":"research","status":"publish","type":"page","link":"https:\/\/wordpress.cs.vt.edu\/algorithms\/research\/","title":{"rendered":"Research"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\"><strong>Interests<\/strong><\/h2>\n\n\n\n<p>My research focuses on designing provable algorithms for optimization problems. I draw ideas from multiple areas of mathematics including graph theory, fixed and high dimensional geometry, algebraic topology, and decision theory.&nbsp;More recently, I have also ventured into machine learning and have on-going efforts to improve the state-of-the-art for the traveling salesman problem as well as the k-server problems. Specific research directions include but are not limited to the following areas:<\/p>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-9d6595d7 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\">\n<ul class=\"wp-block-list\"><li>Matching<\/li><li>Online Algorithms<\/li><li>Optimal Transport<\/li><\/ul>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\">\n<ul class=\"wp-block-list\"><li>Topological Data Analysis<\/li><li>Geometric Optimization<\/li><\/ul>\n<\/div>\n<\/div>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"block-7c0f72dc-bca7-431c-9045-b18c86df635a\"><strong>Funding &amp; Awards<\/strong><\/h2>\n\n\n\n<p>\u201cEfficient Algorithms for Optimal Transport in Geometric Settings\u201d (NSF), $308,000, Jun\u201922- Jun\u201925.<\/p>\n\n\n\n<p id=\"block-cef0fd39-c5ff-4c8e-9006-e91ec597bd8c\">\u201cAlgorithms for Fundamental Optimization Problems in Computational Geometry\u201d (NSF), $450,000, Jul\u201919- Jun\u201923<\/p>\n\n\n\n<p id=\"block-a28e391d-64d3-4029-bd42-bdac3ce2babf\">\u201cThe Geometry Behind Logistics&nbsp;\u2010&nbsp;Approximation Algorithms for Real\u2010Time Delivery\u201d&nbsp;(NSF CRII), $175,000, Feb\u201915- Jan\u201918<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Interests My research focuses on designing provable algorithms for optimization problems. I draw ideas from multiple areas of mathematics including graph theory, fixed and high dimensional geometry, algebraic topology, and decision theory.&nbsp;More recently, I have also ventured into machine learning and have on-going efforts to improve the state-of-the-art for the traveling salesman problem as well &#8230; <a title=\"Research\" class=\"read-more\" href=\"https:\/\/wordpress.cs.vt.edu\/algorithms\/research\/\" aria-label=\"Read more about Research\">Read more<\/a><\/p>\n","protected":false},"author":301,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-21","page","type-page","status-publish"],"_links":{"self":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/21","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/users\/301"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/comments?post=21"}],"version-history":[{"count":14,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/21\/revisions"}],"predecessor-version":[{"id":278,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/21\/revisions\/278"}],"wp:attachment":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/media?parent=21"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}