"Approximation Algorithms and Hardness Results for Packing Element-Disjoint ..."

Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani (2012)

> Home

Details and statistics

DOI: 10.1007/S00453-011-9540-3

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AazamiCJ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AazamiCJ12
Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani:
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Algorithmica 63(1-2): 425-456 (2012)

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.