Anurag Verma

Texas A&M University

Texas A&M University

As a part of my doctoral research, I have focused on three topics that are interdisciplinary in nature and fall within the purview of network based optimization, logistics and network science, with emphasis on both applications and algorithmic perspectives.

The first topic focuses on the upcoming area of graph based data mining. A generic technique, its applications has been explored in several domains like social network analysis, retail and genetics, to name a few. My research has focused on exploring and evaluating new clique relaxations that are of significant value to this field.

The second topic concerns the development of a stochastic optimization model and algorithmic improvements for optimal location of facilities to store emergency supplies. I study the implications of a wider set of realistic assumptions commonly absent in location models used for such decisions, and provide a new model that accounts for these.

Lastly, I also developed an energy efficient distributed approximation algorithm for finding a virtual backbone for efficient communication in wireless sensor networks.

Publications:
  • Anurag Verma, Sergiy Butenko. A distributed approximation algorithm for the bottleneck connected dominating set problem. Optimization Letters. DOI: 10.1007/s11590-011-0314-2
  • Anurag Verma, Gary M Gaukler. Locating Disaster Response Facilities for Large Scale Emergencies. IIE Transactions, under review.
  • Anurag Verma, Gary M Gaukler. A Stochastic Optimization Model for Positioning Disaster Response Facilities for Large Scale Emergencies. International Network Optimization Conference, 2011 (Lecture Notes in Computer Science).
  • Anurag Verma, Sergiy Butenko. A scale reduction algorithm to find maximum clique in very large sparse networks. Working Paper.
  • Anurag Verma, Sergiy Butenko. Network Clustering via Clique Relaxations: A Community Based Approach. Submitted to the 10th DIMACS Challenge.
  • Conference Talks:
  • Locating Disaster Response Facilities for Large Scale Emergencies. INFORMS National Conference, Austin, TX. Nov 7-10, 2010.
  • A 6-Approximate Algorithms for Bottleneck Connected Domination in Wireless Sensor Networks. INFORMS National Conference, Austin, TX. Nov 7-10, 2010.
  • Approximate Algorithms for Bottleneck Connected Domination in Wireless Sensor Networks. Yalta Optimization Conference - Network Science, Yalta, Ukraine. Aug 2-4, 2010.
  • Bottleneck Connected Domination in Wireless Sensor Networks. 2nd International Conference on the Dynamics of Information Systems, Destin, FL. Feb 3-5, 2010.
  • Network Based Techniques for Mining Stock Market Data. 20th International Symposium on Mathematical Programming, Chicago, IL. August 23-28, 2009.