Research:
My research interests are in algorithm design and analysis,
with a focus on graphs and vehicle routing problems. In particular,
I am interested in developing online, approximation, and randomized
algorithms, and testing these algorithms on real-world
data. I am also interested in modeling and simulating stochastic
networks for routing and traveling problems.
Publications:
Barbara Anthony, Christine Chung, Ananya Das, David Yuen. Earliest
Deadline First is a 2-approximation for
DARP with Time Windows. Conference on Combinatorial
Algorithms and Applications (COCOA), December 2023.
Ananya Das Christman, Christine Chung, Nicholas Jaczko,
Tianzhi Li, Scott Westvold, Xinyue Xu, David Yuen.
Improved bounds for budgeted Online Dial-a-Ride.
Springer Nature Operations Research Forum. July 2021. [pdf]
Barbara Anthony, Ananya Das Christman, Christine
Chung, Patrick Davis, Jigar Dhimar, David Yuen.
Serving rides of equal importance for budgeted Dial-a-Ride.
International Conference on Mathematical
Optimization Theory and Operations Research (MOTOR), July 2021.
[pdf]
Ananya Das Christman, Christine Chung,
Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David
Yuen. New bounds for
maximizing revenue in online dial-a-ride.
International Workshop on Combinatorial Algorithms (IWOCA). June
2020. [pdf]
Ananya Das Christman, Christine
Chung, Nicholas Jaczko, Scott Westvold, David Yuen. Robustly Hosting
Unstable Items.
Journal of
Combinatorial Optimization (JOCO). January 2020. [pdf]
Barbara Anthony, Sara
Boyd, Ricky Birnbaum, Ananya Christman, Christine Chung, Patrick
Davis, Jigar Dhimar, David Yuen.
Maximizing the number of rides served for Dial-a-Ride. Workshop on Algorithmic Approaches for
Transportation Modelling,
Optimization, and Systems (ATMOS). September 2019. [pdf]
Ananya Das Christman, Christine Chung, Nicholas Jaczko, Scott
Westvold, David Yuen. Robustly Hosting Unstable Items.
Conference on Combinatorial Optimization and Applications (COCOA).
Decemeber 2018. [pdf]
Ananya Das Christman, William Forcier, Aayam Poudel. From theory
to practice: maximizing profit for Online Dial-a-Ride.
Journal of Combinatorial Optimization (JOCO). October 2017. [pdf]
Ananya Das Christman, Christine Chung, Nicholas Jaczko, Marina
Milan, Anna Vasilchenko, Scott Westvold. Revenue
Maximization in Online Dial-A-Ride. Workshop on Algorithmic
Approaches for Transportation Modelling, Optimization, and
Systems (ATMOS). September 2017. [pdf]
Hamza Alsarhan, Davin Chia, Ananya Christman, Shannia Fu, Yanfeng
Jin. A Two-Pass Algorithm for Unordered Colored
Bin Packing. Conference on Discrete Optimization and
Operations Research (DOOR) (now known as
Mathematical Optimization
Theory and Operations Research (MOTOR)). September 2016. [pdf]
Ananya Das Christman and William Forcier.
Maximizing
Revenues for On-Line Dial-a-Ride. Conference on
Combinatorial and
Optimization Algorithms (COCOA). December 2014. [pdf]
Ananya Das Christman and Joao Cassamano. Maximizing the Probability of Arriving on
Time. Analytical and Stochastic Modeling
Techniques and Applications (ASMTA). July 2013. [pdf]
Ananya Das. Maximizing Profit Using
SLA-Aware Provisioning. IEEE Network Operations and Management
Symposium (NOMS).
April 2012. [pdf]
Ananya Das, Charles Martel, Biswanath Mukherjee, and
Smita Rai. A New Approach
to Reliable Multipath Provisioning. Journal of
Optical Communications and Networking (JOCN), Vol. 3, issue 1, pp.
95-103, December 2010. [pdf]
Ananya
Das, Charles Martel, Biswanath Mukherjee. A Partial-Protection Approach
Using Multipath Provisioning. IEEE International
Communications Conference (ICC). June 2009. [pdf]
Ananya Das and
Charles Martel. Stochastic
Shortest Paths with Unlimited Hops. Information Processing
Letters (IPL). Vol. 109,
issue 5, pp. 290-295, February 2009. [pdf]
Ananya Das, Charles
Martel, Biswanath Mukherjee, Smita Rai. A Better Approach to Multipath Provisioning.
IEEE Global
Telecommunications Conference (GLOBECOM), March 2007. [pdf]
A
Better Ap
Mukherjee,