Approximating the volume of a truncated relaxation of the independence polytope
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929312457818112 |
|---|---|
| author | Bencs, Ferenc Regts, Guus |
| author_facet | Bencs, Ferenc Regts, Guus |
| contents | Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set polytope, improving on their quasi-polynomial time algorithm. Our algorithm is obtained by viewing the volume as an evaluation of a graph polynomial and we approximate this evaluation using Barvinok's interpolation method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_08577 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Approximating the volume of a truncated relaxation of the independence polytope Bencs, Ferenc Regts, Guus Combinatorics Discrete Mathematics Data Structures and Algorithms 05C31, 52B55, 05C69 Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set polytope, improving on their quasi-polynomial time algorithm. Our algorithm is obtained by viewing the volume as an evaluation of a graph polynomial and we approximate this evaluation using Barvinok's interpolation method. |
| title | Approximating the volume of a truncated relaxation of the independence polytope |
| topic | Combinatorics Discrete Mathematics Data Structures and Algorithms 05C31, 52B55, 05C69 |
| url | https://arxiv.org/abs/2404.08577 |