default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. WAOA 2013: Sophia Antipolis, France
- Christos Kaklamanis, Kirk Pruhs:
Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8447, Springer 2014, ISBN 978-3-319-08000-0 - Trevor I. Fenner, Oded Lachish
, Alexandru Popa:
Min-Sum 2-Paths Problems. 1-11 - Ofer Neiman:
Low Dimensional Embeddings of Doubling Metrics. 12-23 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. 24-36 - Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover Problem. 37-48 - MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. 49-60 - Ulrich Pferschy, Joachim Schauer:
Approximating the Quadratic Knapsack Problem on Special Graph Classes. 61-72 - Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau:
Approximating the Sparsest k-Subgraph in Chordal Graphs. 73-84 - Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter. 85-96 - Erika M. M. Coelho, Mitre Costa Dourado, Rudini M. Sampaio:
Inapproximability Results for Graph Convexity Parameters. 97-107 - Hemant Tyagi, Bernd Gärtner:
Continuum Armed Bandit Problem of Few Variables in High Dimensions. 108-119 - Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul:
Approximability of Connected Factors. 120-131 - Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee:
Reordering Buffer Management with Advice. 132-143 - Marek Cygan, Lukasz Jez:
Online Knapsack Revisited. 144-155 - Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Counting Approximately-Shortest Paths in Directed Acyclic Graphs. 156-167
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 2024-10-31 20:19 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:
