default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13. WAOA 2015: Patras, Greece
- Laura Sanità, Martin Skutella:
Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers. Lecture Notes in Computer Science 9499, Springer 2015, ISBN 978-3-319-28683-9 - Bodo Manthey, Marten Waanders:
Approximation Algorithms for k-Connected Graph Factors. 1-12 - Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal
:
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. 13-24 - Katarzyna E. Paluch:
Maximum ATSP with Weights Zero and One via Half-Edges. 25-34 - Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. 35-46 - Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. 47-58 - Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Shortest Augmenting Paths for Online Matchings on Trees. 59-71 - Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama:
Buyback Problem with Discrete Concave Valuation Functions. 72-83 - Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
On Temporally Connected Graphs of Small Cost. 84-96 - Shay Mozes, Eyal E. Skop:
Efficient Vertex-Label Distance Oracles for Planar Graphs. 97-109 - Yishay Mansour, Boaz Patt-Shamir, Shai Vardi:
Constant-Time Local Computation Algorithms. 110-121 - Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. 122-132 - Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. 133-144 - Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. 145-157 - Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul:
On Independent Set on B1-EPG Graphs. 158-169 - Jan Reineke, Alejandro Salinger:
On the Smoothness of Paging Algorithms. 170-182 - Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. 183-195 - Veerle Timmermans, Tjark Vredeveld:
Scheduling with State-Dependent Machine Speed. 196-208
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-12-26 00:35 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:
