"Polynomial-time Approximation Scheme for Minimum k-cut in Planar and ..."

MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi (2019)

> Home

Details and statistics

DOI: 10.1137/1.9781611975482.65

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-15

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/BateniFH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BateniFH19
MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. SODA 2019: 1055-1068

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.