Precedence-Constrained Covering Problems with Multiplicity Constraints

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	WAOA (19. : 2021 : Online) Approximation and online algorithms
1. Verfasser:	Kolliopoulos, Stavros G. (VerfasserIn)
Weitere Verfasser:	Skarlatos, Antonis (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
An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity	2021	Sun, Hao
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource	2021	Jaykrishnan, G.
Server Cloud Scheduling	2021	Maack, Marten
FIFO and Randomized Competitive Packet Routing Games	2021	Tauer, Bjoern
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem	2021	Fujito, Toshihiro
Several Methods of Analysis for Cardinality Constrained Bin Packing	2021	Epstein, Leah
Precedence-Constrained Covering Problems with Multiplicity Constraints	2021	Kolliopoulos, Stavros G.
Contention Resolution, Matrix Scaling and Fair Allocation	2021	Bansal, Nikhil
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback	2021	Blažej, Väclav
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle	2021	Gálvez, Waldo
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems	2021	Dudycz, Szymon
The Traveling k-Median Problem: Approximating Optimal Network Coverage	2021	Hutzing, Dylan
Weighted Completion Time Minimization for Capacitated Parallel Machines	2021	Cohen, Ilan Reuven
Improved Online Algorithm for Fractional Knapsack in the Random Order Model	2021	Giliberti, Jeff
Improved Analysis of Online Balanced Clustering	2021	Bienkowski, Marcin
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint	2021	Disser, Yann