"An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity ..."

Sharat Ibrahimpur, László A. Végh (2025)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2501.12549

access: open

type: Informal or Other Publication

metadata version: 2025-02-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2501-12549
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2501-12549
Sharat Ibrahimpur, László A. Végh:
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding. CoRR abs/2501.12549 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.