Skip to main content

SIAM

Courses
SIAM Home
Search
Sign Up
Sign In

Item Added to Cart

You just added

You have item(s) in your cart

  • Proceed to Checkout
  1. Courses
  2. 2017 SIAM Annual Meeting
  3. Efficient Graph Algorithms

Efficient Graph Algorithms

AN17 - MS68-1: Cooperative Computing for Autonomous Data Centers

Presentation: Cynthia Phillips, Sandia National Laboratories, USA, 24 min 12 sec

AN17 - MS68-1: Cooperative Computing for Autonomous Data Centers

Document: AN17 - MS68-1: Cooperative Computing for Autonomous Data Centers(PDF)

AN17 - MS68-2: Parallel Graph Algorithms: Simple, Efficient and Scalable

Presentation: Laxman Dhulipala, Carnegie Mellon University, USA, 24 min 55 sec

AN17 - MS68-2: Parallel Graph Algorithms: Simple, Efficient and Scalable

Document: AN17 - MS68-2: Parallel Graph Algorithms: Simple, Efficient and Scalable(PDF)

AN17 - MS68-3: Quantum Approximation Algorithms

Presentation: Ojas Parekh, Sandia National Laboratories, USA, 28 min 58 sec

AN17 - MS68-3: Quantum Approximation Algorithms

Document: AN17 - MS68-3: Quantum Approximation Algorithms(PDF)

AN17 - MS68-4: Approximation Algorithms for Inventory Routing

Presentation: Yang Jiao, Carnegie Mellon University, USA, 22 min 56 sec

AN17 - MS68-4: Approximation Algorithms for Inventory Routing

Document: AN17 - MS68-4: Approximation Algorithms for Inventory Routing(PDF)
  • Courses
  • Search
  • Support
  • SIAM Home
  • Sign Up
  • Sign In
  • Privacy Policy | Cookies Policy