"Approximation algorithms and hardness of the k-route cut problem."

Julia Chuzhoy et al. (2012)

> Home

Details and statistics

DOI: 10.1137/1.9781611973099.63

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/ChuzhoyMVZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChuzhoyMVZ12
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation algorithms and hardness of the k-route cut problem. SODA 2012: 780-799

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.