"Optimal Approximations for the Requirement Cut Problem on Sparse Graph ..."

Nadym Mallek, Kirill Simonov (2026)

> Home

Details and statistics

DOI: 10.1007/978-3-032-17801-5_40

access: closed

type: Conference or Workshop Paper

metadata version: 2026-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/MallekS26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/MallekS26
Nadym Mallek, Kirill Simonov:
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes. SOFSEM 2026: 547-562

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.