Polynomiality of sparsest cuts with fixed number of sources
Year of publication: |
2007
|
---|---|
Authors: | Hong, Sung-Pil ; Choi, Byung-Cheon |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 35.2007, 6, p. 739-742
|
Saved in:
Saved in favorites
Similar items by person
-
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
Park, Myoung-Ju, (2013)
-
PARK, BUM HWAN, (2013)
-
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Hong, Sung-Pil, (2004)
- More ...