AAIM C

33 papers

YearTitle / Authors
2008A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem.
Zeyu Guo, He Sun, Hong Zhu
2008A Meeting Scheduling Problem Respecting Time and Space.
Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
2008Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings
Rudolf Fleischer, Jinhui Xu
2008Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems.
Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert
2008An Improved Randomized Approximation Algorithm for Maximum Triangle Packing.
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
2008An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the l
Tianping Shuai, Donglei Du, Xiaoyue Jiang
2008An Optimal Strategy for Online Non-uniform Length Order Scheduling.
Feifeng Zheng, E. Zhang, Yinfeng Xu, Xiaoping Wu
2008Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement.
Zhi-Zhong Chen, Ruka Tanahashi
2008Confidently Cutting a Cake into Approximately Fair Pieces.
Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
2008Copeland Voting Fully Resists Constructive Control.
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
2008Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.
Ding-Zhu Du
2008Engineering Comparators for Graph Clusterings.
Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner
2008Engineering Label-Constrained Shortest-Path Algorithms.
Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
2008Facility Location Problems: A Parameterized View.
Michael R. Fellows, Henning Fernau
2008Finding Optimal Refueling Policies in Transportation Networks.
Shieu-Hong Lin
2008Fixed-Parameter Algorithms for Kemeny Scores.
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2008Graphs and Path Equilibria.
Stéphane Le Roux
2008Large-Scale Parallel Collaborative Filtering for the Netflix Prize.
Yunhong Zhou, Dennis M. Wilkinson, Robert Schreiber, Rong Pan
2008Line Facility Location in Weighted Regions.
Yam Ki Cheung, Ovidiu Daescu
2008Minimum Cost Homomorphism Dichotomy for Oriented Cycles.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008Minimum Leaf Out-Branching Problems.
Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2008Nash Bargaining Via Flexible Budget Markets.
Vijay V. Vazirani
2008New Upper Bounds on Continuous Tree Edge-Partition Problem.
Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi
2008No lGrid-Points in Spaces of Small Dimension.
Hanno Lefmann
2008On Representation of Planar Graphs by Segments.
Sadish Sadasivam, Huaming Zhang
2008On the Fast Searching Problem.
Danny Dyer, Boting Yang, Öznur Yasar
2008On the Minimum Hitting Set of Bundles Problem.
Eric Angel, Evripidis Bampis, Laurent Gourvès
2008Scale Free Interval Graphs.
Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe
2008Shortest Path Queries in Polygonal Domains.
Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack
2008Speed Scaling with a Solar Cell.
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
2008The Complexity of Power-Index Comparison.
Piotr Faliszewski, Lane A. Hemaspaandra
2008The Distributed Wireless Gathering Problem.
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2008The Secret Santa Problem.
Leo Liberti, Franco Raimondi