default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. WAOA 2007: Eilat, Israel
- Christos Kaklamanis, Martin Skutella:
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers. Lecture Notes in Computer Science 4927, Springer 2008, ISBN 978-3-540-77917-9 - Robert Krauthgamer
, Aranyak Mehta, Atri Rudra:
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. 1-14 - Iftah Gamzu:
Improved Lower Bounds for Non-utilitarian Truthfulness. 15-26 - Nedialko B. Dimitrov, C. Greg Plaxton:
Buyer-Supplier Games: Optimization over the Core. 27-40 - Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. 41-54 - Alexander A. Ageev:
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. 55-66 - Johann L. Hurink, Jacob Jan Paulus:
Online Algorithm for Parallel Job Scheduling and Strip Packing. 67-74 - Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners with Small Chromatic Number. 75-88 - Maarten Löffler, Marc J. van Kreveld:
Approximating Largest Convex Hulls for Imprecise Points. 89-102 - Alexander A. Ageev, Artem V. Pyatkin:
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. 103-115 - Dorit S. Hochbaum, Asaf Levin:
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. 116-127 - Amitai Armon:
On Min-Max r -Gatherings. 128-141 - Leah Epstein, Asaf Levin:
On the Max Coloring Problem. 142-155 - Panagiota N. Panagopoulou, Paul G. Spirakis:
Full and Local Information in Distributed Decision Making. 156-169 - Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover Problem. 170-183 - José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi:
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. 184-192 - Leah Epstein, Rob van Stee:
On the Online Unit Clustering Problem. 193-206 - Marek Chrobak, Mathilde Hurand:
Better Bounds for Incremental Medians. 207-217 - Leah Epstein, Asaf Levin:
Minimum Weighted Sum Bin Packing. 218-231 - Leah Epstein, Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints. 232-245 - Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A Randomized Algorithm for Two Servers in Cross Polytope Spaces. 246-259 - Anke van Zuylen, David P. Williamson:
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. 260-273 - Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
Online Rectangle Filling. 274-287
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-06 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
