default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th WAOA 2021: Lisbon, Portugal
- 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 - Waldo Gálvez
, Francisco Sanhueza-Matamala, José A. Soto:
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. 1-22 - 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. 23-38 - Hao Sun:
An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity. 39-47 - Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski:
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems. 48-64 - Toshihiro Fujito, Takumi Tatematsu:
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem. 65-79 - Dylan Huizing, Guido Schäfer:
The Traveling k-Median Problem: Approximating Optimal Network Coverage. 80-98 - G. Jaykrishnan, Asaf Levin:
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. 99-116 - Leah Epstein:
Several Methods of Analysis for Cardinality Constrained Bin Packing. 117-129 - Ilan Reuven Cohen, Izack Cohen, Iyar Zaks:
Weighted Completion Time Minimization for Capacitated Parallel Machines. 130-143 - Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Server Cloud Scheduling. 144-164 - Bjoern Tauer, Laura Vargas Koch:
FIFO and Randomized Competitive Packet Routing Games. 165-187 - Jeff Giliberti, Andreas Karrenbauer:
Improved Online Algorithm for Fractional Knapsack in the Random Order Model. 188-205 - Yann Disser, Max Klimm, David Weckbecker:
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. 206-223 - Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. 224-233 - Stavros G. Kolliopoulos, Antonis Skarlatos:
Precedence-Constrained Covering Problems with Multiplicity Constraints. 234-251 - Nikhil Bansal, Ilan Reuven Cohen:
Contention Resolution, Matrix Scaling and Fair Allocation. 252-274
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-11-22 19:46 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:
