An approximation algorithm for the edge-dilation k-center problem
Year of publication: |
2004
|
---|---|
Authors: | Könemann, Jochen ; Li, Yanjun ; Parekh, Ojas ; Sinha, Amitabh |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 32.2004, 5, p. 491-495
|
Saved in:
Saved in favorites
Similar items by person
-
A -integral relaxation for the A-matching problem
Carr, Robert, (2006)
-
Synergies between operations research and quantum information science
Parekh, Ojas, (2023)
-
Special issue of INFORMS Journal on Computing : quantum computing and operations research
Coffrin, Carleton, (2023)
- More ...