Abstract is missing.
- Strategic Multiway Cut and Multicut GamesElliot Anshelevich, Bugra Caskurlu, Ameya Hate. 1-12 [doi]
- Approximating Directed Buy-at-Bulk Network DesignSpyridon Antonakopoulos. 13-24 [doi]
- New Lower Bounds for Certain Classes of Bin Packing AlgorithmsJános Balogh, József Békési, Gábor Galambos. 25-36 [doi]
- On the Approximation Complexity HierarchyMagnus Bordewich. 37-46 [doi]
- The Power of Uncertainty: Bundle-Pricing for Unit-Demand CustomersPatrick Briest, Heiko Röglin. 47-58 [doi]
- Tradeoff between Energy and Throughput for Online Deadline SchedulingHo-Leung Chan, Tak Wah Lam, Rongbin Li. 59-70 [doi]
- New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract)Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid. 71-82 [doi]
- Densest ::::k::::-Subgraph Approximation on Intersection GraphsDanny Z. Chen, Rudolf Fleischer, Jian Li. 83-93 [doi]
- The Train Delivery Problem - Vehicle Routing Meets Bin PackingAparna Das, Claire Mathieu, Shay Mozes. 94-105 [doi]
- An FPTAS for Flows over Time with Aggregate Arc CapacitiesDaniel Dressler, Martin Skutella. 106-117 [doi]
- List Factoring and Relative Worst Order AnalysisMartin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen. 118-129 [doi]
- Approximation Algorithms for Domination SearchFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. 130-141 [doi]
- Lower Bounds for Smith s Rule in Stochastic Machine SchedulingCaroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz. 142-153 [doi]
- Approximating Survivable Networks with Minimum Number of Steiner PointsLior Kamma, Zeev Nutov. 154-165 [doi]
- A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline TasksAndreas Karrenbauer, Thomas Rothvoß. 166-177 [doi]
- Online Tracking of the Dominance Relationship of Distributed Multi-dimensional DataTak Wah Lam, Chi-Man Liu, Hing-Fung Ting. 178-189 [doi]
- Online Ranking for Tournament GraphsClaire Mathieu, Adrian Vladu. 201-212 [doi]
- Throughput Maximization for Periodic Packet Routing on Trees and GridsBritta Peis, Andreas Wiese. 213-224 [doi]
- ::::k::::-Edge-Connectivity: Approximation and LP RelaxationDavid Pritchard. 225-236 [doi]
- Minimizing Maximum Flowtime of Jobs with Arbitrary ParallelizabilityKirk Pruhs, Julien Robert, Nicolas Schabanel. 237-248 [doi]
- An Improved Algorithm for Online Rectangle FillingRob van Stee. 249-260 [doi]
- Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction ProblemsTomoyuki Yamakami. 261-272 [doi]