Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2206.08187 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912167619461120 |
|---|---|
| author | Bougeret, Marin Omer, Jérémy Poss, Michael |
| author_facet | Bougeret, Marin Omer, Jérémy Poss, Michael |
| contents | Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any position in given uncertainty sets. Then, the cost function to be minimized is the sum of the distances for the worst positions of the vertices in their uncertainty sets. We propose two types of polynomial-time approximation algorithms. The first one relies on solving a deterministic counterpart of the problem where the uncertain distances are replaced with maximum pairwise distances. We study in details the resulting approximation ratio, which depends on the structure of the feasible subgraphs and whether the metric space is Ptolemaic or not. The second algorithm is a fully-polynomial time approximation scheme for the special case of $s-t$ paths. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_08187 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Approximating optimization problems in graphs with locational uncertainty Bougeret, Marin Omer, Jérémy Poss, Michael Data Structures and Algorithms Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any position in given uncertainty sets. Then, the cost function to be minimized is the sum of the distances for the worst positions of the vertices in their uncertainty sets. We propose two types of polynomial-time approximation algorithms. The first one relies on solving a deterministic counterpart of the problem where the uncertain distances are replaced with maximum pairwise distances. We study in details the resulting approximation ratio, which depends on the structure of the feasible subgraphs and whether the metric space is Ptolemaic or not. The second algorithm is a fully-polynomial time approximation scheme for the special case of $s-t$ paths. |
| title | Approximating optimization problems in graphs with locational uncertainty |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2206.08187 |