To Close Is Easier Than To Open: Dual Parameterization To k-Median

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	WAOA (18. : 2020 : Online) Approximation and Online Algorithms
1. Verfasser:	Byrka, Jarostaw (VerfasserIn)
Weitere Verfasser:	Dudycz, Szymon (VerfasserIn), Manurangsi, Pasin (VerfasserIn), Marcinkowski, Jan (VerfasserIn), Wlodarczyk, Michal (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Online Coloring and a New Type of Adversary for Online Graph Problems	2021	Li, Yaqiao
A Faster FPTAS for Knapsack Problem with Cardinality Constraint	2021	Li, Wenxin
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique	2021	Schäfer, Guido
Lasserre Integrality Gaps for Graph Spanners and Related Problems	2021	Dinitz, Michael
Explorable Uncertainty in Scheduling with Non-uniform Testing Times	2021	Albers, Susanne
Concave Connection Cost Facility Location and the Star Inventory Routing Problem	2021	Byrka, Jarostaw
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks	2021	Madireddy, Raghunath Reddy
Distributed Algorithms for Matching in Hypergraphs	2021	Hanguir, Oussama
2-Node-Connectivity Network Design	2021	Nutov, Zeev
LP-Based Algorithms for Multistage Minimization Problems	2021	Bampis, Evripidis
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon	2021	Ashur, Stav
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem	2021	Khazraei, Ardalan
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems	2021	Kortsarz, Magnus M. Halldórsson. Guy
To Close Is Easier Than To Open: Dual Parameterization To k-Median	2021	Byrka, Jarostaw
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics	2021	Christou, Dimitris