First Page | Document Content | |
---|---|---|
![]() Date: 2006-03-25 14:27:44Routing algorithms Operations research NP-complete problems Matching Color-coding Connectivity Travelling salesman problem Graph Dynamic programming Graph theory Mathematics Theoretical computer science | Source URL: people.csail.mit.eduDownload Document from Source WebsiteFile Size: 2,53 MBShare Document on Facebook |
![]() | Ensuring Connectivity via Data Plane Mechanisms Junda Liu‡ , Aurojit Panda\ , Ankit Singla† , Brighten Godfrey† , Michael Schapira , Scott Shenker\♠ ‡ Google Inc., \ UC Berkeley, † UIUC, Hebrew U., ♠ ICSDocID: 1xVp6 - View Document |
![]() | figs/connectivity_t1s_numprobes.epsDocID: 1xUSe - View Document |
![]() | Smart City Journey 2018 Hosting Companies: IoT and Connectivity 31 October 2018, 8:30am-11:30am @Kraftwerk, Zurich Innovation Workshop - RSVP on Doodle or Sched thDocID: 1xUd4 - View Document |
![]() | Augur: Internet-Wide Detection of Connectivity Disruptions Paul Pearce†∗ , Roya Ensafi§∗ , Frank Li† , Nick Feamster§ , Vern Paxson† † University of California, Berkeley § Princeton UniversityDocID: 1xTJG - View Document |
![]() | Multivariate Pattern ConnectivityDocID: 1xT7m - View Document |