Fields- Workshop on Flexible Network Design
-
Title: Smallest two-edge-connected spanning subgraphs and the TSP
Speaker:
Link:
-
Title: ATSP and No-Wait Flowshop
Speaker:
Link:
-
Title: Approximation Algorithms for the Joint Replenishment Problem with Deadlines
Speaker:
Link:
-
Title: Hallucination Helps: Energy Efficient Virtual Circuit Routing
Speaker:
Link:
-
Title: Chain-Constrained Spanning Trees
Speaker:
Link:
-
Title: Spectrally Thin Trees
Speaker:
Link:
-
Title: Approximating Bin Packing within O(log OPT log log OPT) bins
Speaker:
Link:
-
Title: The Euclidean k-Supplier Problem
Speaker:
Link:
-
Title: Non-uniform Graph Partitioning
Speaker:
Link:
-
Title: A Polynomial-time Cutting Plane Algorithm for Perfect Matchings
Speaker:
Link:
-
Title: The Online Replacement Path Problem
Speaker:
Link:
-
Title: Network Design with Coverage Costs
Speaker:
Link:
-
Title: Algorithmic Game Theory of eBay Buyer-Seller Matching
Speaker:
Link:
-
Title: Multiroute Flows and Node-weighted Network Design
Speaker:
Link:
-
Title: A Constant Factor Approximation for Regret-Bounded Vehicle Routing
Speaker:
Link:
-
Title: On the Complexity of Information Spreading in Dynamic Networks
Speaker:
Link:
-
Title: Centrality of Trees for Capacitated k-Center
Speaker:
Link:
-
Title: Design of Interdomain Overlay Networks
Speaker:
Link:
-
Title: Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Speaker:
Link:
-
Title: Iterative Rounding Approximation Algorithms for Degree-bounded Node-connectivity Network Design
Speaker:
Link: