Pages that link to "Item:Q4978000"

The following pages link to Online and dynamic algorithms for set cover (Q4978000):

Displaying 25 items.

• Online maximum \(k\)-coverage (Q442204) (← links)
• Dynamic algorithms via the primal-dual method (Q1640995) (← links)
• Online set multicover algorithms for dynamic D2D communications (Q1679520) (← links)
• Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
• Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
• Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
• Online load balancing with general reassignment cost (Q2157902) (← links)
• Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
• Reoptimization of set covering problems (Q2247803) (← links)
• Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
• Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
• Online maximum \(k\)-interval coverage problem (Q2692231) (← links)
• Greedy algorithms for on-line set-covering (Q2867360) (← links)
• (Q3575997) (← links)
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
• (Q5009521) (← links)
• (Q5090485) (← links)
• Improved algorithm for dynamic b-Matching (Q5111701) (← links)
• (Q5111737) (← links)
• Online Dominating Set (Q5369523) (← links)
• (Q5874472) (← links)
• Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
• Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
• Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
• Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) (Q6190006) (← links)