WAOA B

17 papers

YearTitle / Authors
2021An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity.
Hao Sun
2021Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle.
Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto
2021Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers
Jochen Könemann, Britta Peis
2021Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2021Contention Resolution, Matrix Scaling and Fair Allocation.
Nikhil Bansal, Ilan Reuven Cohen
2021EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource.
G. Jaykrishnan, Asaf Levin
2021FIFO and Randomized Competitive Packet Routing Games.
Bjoern Tauer, Laura Vargas Koch
2021Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.
Yann Disser, Max Klimm, David Weckbecker
2021Improved Analysis of Online Balanced Clustering.
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
2021Improved Online Algorithm for Fractional Knapsack in the Random Order Model.
Jeff Giliberti, Andreas Karrenbauer
2021On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem.
Toshihiro Fujito, Takumi Tatematsu
2021Precedence-Constrained Covering Problems with Multiplicity Constraints.
Stavros G. Kolliopoulos, Antonis Skarlatos
2021Server Cloud Scheduling.
Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop
2021Several Methods of Analysis for Cardinality Constrained Bin Packing.
Leah Epstein
2021The Traveling k-Median Problem: Approximating Optimal Network Coverage.
Dylan Huizing, Guido Schäfer
2021Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems.
Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski
2021Weighted Completion Time Minimization for Capacitated Parallel Machines.
Ilan Reuven Cohen, Izack Cohen, Iyar Zaks