"A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT ..."

Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo (2024)

> Home

Details and statistics

DOI: 10.1007/S10107-023-02044-1

access: closed

type: Journal Article

metadata version: 2024-08-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/CohenAddadMV24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/CohenAddadMV24
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. Math. Program. 206(1): 479-495 (2024)

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.