The Power of Amortized Recourse for Online Graph Problems

06/02/2022
by   Hsiang-Hsuan Liu, et al.
0

In this work, we study graph problems with monotone-sum objectives. We propose a general two-fold greedy algorithm that references α-approximation algorithms (where α≥ 1) to achieve (t ·α)-competitiveness while incurring at most w_max·(t+1)/min{1, w_min}·(t-1) amortized recourse, where w_max and w_min are the largest value and the smallest positive value that can be assigned to an element in the sum. We further refine this trade-off between competitive ratio and amortized recourse for three classical graph problems. For Independent Set, we refine the analysis of our general algorithm and show that t-competitiveness can be achieved with t/t-1 amortized recourse. For Maximum Matching, we use an existing algorithm with limited greed to show that t-competitiveness can be achieved with (2-t^*)/(t^*-1)(3-t^*)+t^*-1/3-t^* amortized recourse, where t^* is the largest number such that t^*= 1 +1/j≤ t for some integer j. For Vertex Cover, we introduce a polynomial-time algorithm that further limits greed to show that (2 - 2/)-competitiveness, where is the size of the optimal vertex cover, can be achieved with at most 10/3 amortized recourse by a potential function argument. We remark that this online result can be used as an offline approximation result (without violating the unique games conjecture) to improve upon that of Monien and Speckenmeyer for graphs containing odd cycles of length no less than 2k + 3, using an algorithm that is also constructive.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2018

Parameterized Power Vertex Cover

We study a recently introduced generalization of the Vertex Cover (VC) p...
research
12/22/2022

Some Results on Approximability of Minimum Sum Vertex Cover

We study the Minimum Sum Vertex Cover problem, which asks for an orderin...
research
07/25/2018

Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems

In this work, we study the trade-off between the running time of approxi...
research
09/17/2020

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms

We introduce and study two natural generalizations of the Connected Vert...
research
10/17/2021

On Monotonicity of Number-Partitioning Algorithms

An algorithm for number-partitioning is called value-monotone if wheneve...
research
02/10/2022

Online Learning for Min Sum Set Cover and Pandora's Box

Two central problems in Stochastic Optimization are Min Sum Set Cover an...

Please sign up or login with your details

Forgot password? Click here to reset