scientific article; zbMATH DE number 7375946

DOI10.4230/LIPIcs.ICALP.2018.19zbMath1499.68398arXiv1804.10791MaRDI QIDQ5002685

Davide Bilò

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1804.10791

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Steiner tree problemapproximation algorithmsreoptimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

Robust reoptimization of Steiner trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reoptimization of maximum weight induced hereditary subgraph problems
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• A note on the traveling salesman reoptimization problem under vertex insertion
• Reoptimizing the rural postman problem
• Reoptimizing the 0-1 knapsack problem
• Reoptimization of the shortest common superstring problem
• Reallocation problems in scheduling
• Reoptimization of Steiner trees: changing the terminal set
• Fast reoptimization for the minimum spanning tree problem
• Approximation hardness of deadline-TSP reoptimization
• Reoptimization of minimum and maximum traveling salesman's tours
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• Reoptimization of the metric deadline TSP
• Reoptimization of Minimum Latency problem
• Reoptimization in machine scheduling
• New Reoptimization Techniques applied to Steiner Tree Problem
• REOPTIMIZATION UNDER VERTEX INSERTION: MAX P_k-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH
• A survey on combinatorial optimization in dynamic environments
• New Advances in Reoptimizing the Minimum Steiner Tree Problem
• Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
• On the Hardness of Reoptimization with Multiple Given Solutions
• Reoptimization of Steiner Trees
• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
• Thek-Steiner Ratio in Graphs
• Reoptimizing the traveling salesman problem
• Robust Reoptimization of Steiner Trees
• Steiner Tree Approximation via Iterative Randomized Rounding
• On the Hardness of Reoptimization
• The steiner problem in graphs
• Scheduling with forbidden sets

This page was built for publication: