jQuery('#ajaxmodal .modal-body-content').html('
\nRecorded\n13 June 2012\nin Lausanne, Vaud, Switzerland\n<\/p>\n
\nEvent:<\/b>\nSuRI<\/a>\n- I&C - Summer Research Institute\n<\/p>\n A fundamental problem in combinatorial optimization is the edge-disjoint paths problem (EDP). We are given a network and a collection of source-destination pairs in the network. The goal is to maximize the number of pairs that can be connected by edge-disjoint paths. Even special cases of EDP correspond to non-trivial optimization problems, and the problem becomes NP-hard in very restricted settings. We will survey some recent progress on understanding the approximability threshold of EDP.<\/p>\n\n<\/div>\n Watched 1275 times.<\/p>\n<\/i> Watch<\/a>\n<\/div>\n<\/div>\n<\/div>\n');
jQuery('#ajaxmodal .modal-title').html("Talk Details");
jQuery('#ajaxmodal').modal({keyboard: true, show: true});
Abstract<\/h4>\n