- 2021
- Nikhil Bansal, Ilan Reuven Cohen:
Contention Resolution, Matrix Scaling and Fair Allocation. WAOA 2021: 252-274 - Marcin Bienkowski
, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. WAOA 2021: 224-233 - Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA 2021: 23-38 - Ilan Reuven Cohen, Izack Cohen, Iyar Zaks:
Weighted Completion Time Minimization for Capacitated Parallel Machines. WAOA 2021: 130-143 - Yann Disser, Max Klimm, David Weckbecker:
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. WAOA 2021: 206-223 - Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski:
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems. WAOA 2021: 48-64 - Leah Epstein:
Several Methods of Analysis for Cardinality Constrained Bin Packing. WAOA 2021: 117-129 - Toshihiro Fujito, Takumi Tatematsu:
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem. WAOA 2021: 65-79 - Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto:
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. WAOA 2021: 1-22 - Jeff Giliberti, Andreas Karrenbauer:
Improved Online Algorithm for Fractional Knapsack in the Random Order Model. WAOA 2021: 188-205 - Dylan Huizing, Guido Schäfer:
The Traveling k-Median Problem: Approximating Optimal Network Coverage. WAOA 2021: 80-98 - G. Jaykrishnan, Asaf Levin:
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. WAOA 2021: 99-116 - Stavros G. Kolliopoulos, Antonis Skarlatos:
Precedence-Constrained Covering Problems with Multiplicity Constraints. WAOA 2021: 234-251 - Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Server Cloud Scheduling. WAOA 2021: 144-164 - Hao Sun:
An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. WAOA 2021: 39-47 - Bjoern Tauer, Laura Vargas Koch:
FIFO and Randomized Competitive Packet Routing Games. WAOA 2021: 165-187 - Christos Kaklamanis, Asaf Levin:
Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12806, Springer 2021, ISBN 978-3-030-80878-5 [contents] - Jochen Könemann, Britta Peis:
Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12982, Springer 2021, ISBN 978-3-030-92701-1 [contents] - 2020
- Susanne Albers, Alexander Eckl:
Explorable Uncertainty in Scheduling with Non-uniform Testing Times. WAOA 2020: 127-142 - Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. WAOA 2020: 81-96 - Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-Based Algorithms for Multistage Minimization Problems. WAOA 2020: 1-15 - Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA 2020: 113-126 - Jaroslaw Byrka, Mateusz Lewandowski:
Concave Connection Cost Facility Location and the Star Inventory Routing Problem. WAOA 2020: 174-188 - Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. WAOA 2020: 143-158 - Michael Dinitz, Yasamin Nazari, Zeyu Zhang:
Lasserre Integrality Gaps for Graph Spanners and Related Problems. WAOA 2020: 97-112 - Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan:
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. WAOA 2020: 159-173 - Oussama Hanguir, Clifford Stein:
Distributed Algorithms for Matching in Hypergraphs. WAOA 2020: 30-46 - Ardalan Khazraei, Stephan Held:
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. WAOA 2020: 189-203 - Wenxin Li, Joohyun Lee, Ness B. Shroff:
A Faster FPTAS for Knapsack Problem with Cardinality Constraint. WAOA 2020: 16-29 - Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. WAOA 2020: 47-62
