Abstract is missing.
- LP-Based Algorithms for Multistage Minimization ProblemsEvripidis Bampis, Bruno Escoffier, Alexander V. Kononov. 1-15 [doi]
- A Faster FPTAS for Knapsack Problem with Cardinality ConstraintWenxin Li 0004, Joohyun Lee, Ness B. Shroff. 16-29 [doi]
- Distributed Algorithms for Matching in HypergraphsOussama Hanguir, Clifford Stein 0001. 30-46 [doi]
- Online Coloring and a New Type of Adversary for Online Graph ProblemsYaqiao Li, Vishnu V. Narayan, Denis Pankratov. 47-62 [doi]
- Maximum Coverage with Cluster Constraints: An LP-Based Approximation TechniqueGuido Schäfer, Bernard G. Zweers. 63-80 [doi]
- A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-PolygonStav Ashur, Omrit Filtser, Matthew J. Katz. 81-96 [doi]
- Lasserre Integrality Gaps for Graph Spanners and Related ProblemsMichael Dinitz, Yasamin Nazari, Zeyu Zhang. 97-112 [doi]
- To Close Is Easier Than To Open: Dual Parameterization To k-MedianJaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk 0001. 113-126 [doi]
- Explorable Uncertainty in Scheduling with Non-uniform Testing TimesSusanne Albers, Alexander Eckl. 127-142 [doi]
- Memoryless Algorithms for the Generalized k-server Problem on Uniform MetricsDimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos. 143-158 [doi]
- Tight Bounds on Subexponential Time Approximation of Set Cover and Related ProblemsMagnús M. Halldórsson, Guy Kortsarz, Marek Cygan. 159-173 [doi]
- Concave Connection Cost Facility Location and the Star Inventory Routing ProblemJaroslaw Byrka, Mateusz Lewandowski. 174-188 [doi]
- An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree ProblemArdalan Khazraei, Stephan Held. 189-203 [doi]
- A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit DisksRaghunath Reddy Madireddy, Apurva Mudgal. 204-219 [doi]
- 2-Node-Connectivity Network DesignZeev Nutov. 220-235 [doi]