A technical talk on the airfare search problem - the talk is functionally split into three parts. The first part will focus on the airline ticket pricing and the myriad ways in which it is confusing and complicated. The second part talks about why the airfare search problem is hard. This will include a few computational complexity results associated with this problem. Finally, the third part describes the QPX algorithm that Google uses to compute a collection of "best" tickets for an airfare search.
Speaker Bio:
Srikanth Sastry is a software engineer in the Flights Backend team in Google. He received his B. Tech. in Computer Science from NIT Calicut. Subsequently, he received his PhD from Texas A&M University, and spent two years at MIT as a postdoc in the Computer Science and AI Lab. He joined Google in 2013.
It's a Hangout on Air, and it's scheduled for 15th April at 4pm IST. The duration will be about an hour.
This talk can be very insightful as it touches on the very interesting areas of ticket pricing, airline markets, search, and applications of CS in this area
Speaker Bio:
Srikanth Sastry is a software engineer in the Flights Backend team in Google. He received his B. Tech. in Computer Science from NIT Calicut. Subsequently, he received his PhD from Texas A&M University, and spent two years at MIT as a postdoc in the Computer Science and AI Lab. He joined Google in 2013.
Register now!! http://goo.gl/forms/
