default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th WAOA 2020: Virtual Event
- 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 - Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-Based Algorithms for Multistage Minimization Problems. 1-15 - Wenxin Li, Joohyun Lee
, Ness B. Shroff:
A Faster FPTAS for Knapsack Problem with Cardinality Constraint. 16-29 - Oussama Hanguir, Clifford Stein:
Distributed Algorithms for Matching in Hypergraphs. 30-46 - Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. 47-62 - Guido Schäfer, Bernard G. Zweers:
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. 63-80 - Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. 81-96 - Michael Dinitz, Yasamin Nazari, Zeyu Zhang:
Lasserre Integrality Gaps for Graph Spanners and Related Problems. 97-112 - Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
To Close Is Easier Than To Open: Dual Parameterization To k-Median. 113-126 - Susanne Albers, Alexander Eckl:
Explorable Uncertainty in Scheduling with Non-uniform Testing Times. 127-142 - Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. 143-158 - Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan:
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. 159-173 - Jaroslaw Byrka, Mateusz Lewandowski:
Concave Connection Cost Facility Location and the Star Inventory Routing Problem. 174-188 - Ardalan Khazraei, Stephan Held:
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. 189-203 - Raghunath Reddy Madireddy, Apurva Mudgal:
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. 204-219 - Zeev Nutov:
2-Node-Connectivity Network Design. 220-235
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-08 20:38 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:
