"An efficient polynomial time approximation scheme for the constrained ..."

Refael Hassin, Asaf Levin (2004)

> Home

Details and statistics

DOI: 10.1137/S0097539703426775

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/HassinL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/HassinL04
Refael Hassin, Asaf Levin:
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33(2): 261-268 (2004)

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.