New algorithms for Steiner tree reoptimization

04/28/2018
by   Davide Bilò, et al.
0

Reoptimization is a setting in which we are given an (near) optimal solution of a problem instance and a local modification that slightly changes the instance. The main goal is that of finding an (near) optimal solution of the modified instance. We investigate one of the most studied scenarios in reoptimization known as Steiner tree reoptimization. Steiner tree reoptimization is a collection of strongly NP-hard optimization problems that are defined on top of the classical Steiner tree problem and for which several constant-factor approximation algorithms have been designed in the last decade. In this paper we improve upon all these results by developing a novel technique that allows us to design polynomial-time approximation schemes. Remarkably, prior to this paper, no approximation algorithm better than recomputing a solution from scratch was known for the elusive scenario in which the cost of a single edge decreases. Our results are best possible since none of the problems addressed in this paper admits a fully polynomial-time approximation scheme, unless P=NP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2020

Robust Algorithms for TSP and Steiner Tree

Robust optimization is a widely studied area in operations research, whe...
research
08/30/2021

Justifying Groups in Multiwinner Approval Voting

Justified representation (JR) is a standard notion of representation in ...
research
01/06/2018

Joint Data Compression and Caching: Approaching Optimality with Guarantees

We consider the problem of optimally compressing and caching data across...
research
10/10/2020

Decode efficient prefix codes

Data compression is used in a wide variety of tasks, including compressi...
research
12/07/2020

Sequential Resource Access: Theory and Algorithm

We formulate and analyze a generic sequential resource access problem ar...
research
08/29/2022

Inference and Optimization for Engineering and Physical Systems

The central object of this PhD thesis is known under different names in ...
research
02/22/2022

The near exact bin covering problem

We present a new generalization of the bin covering problem that is know...

Please sign up or login with your details

Forgot password? Click here to reset