Browse "School of Computing(전산학부)" by Subject NP-hardness
Showing results 1 to 3 of 3
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.41, no.3, pp.188 - 205, 2008-11 |
| On the Complexity of System Throughput Derivation for Static 802.11 Networks Cheung, Gene; Lee, Jeongkeun; Lee, Sung-Ju; Sharma, Puneet, IEEE COMMUNICATIONS LETTERS, v.14, no.10, pp.906 - 908, 2010-10 |
| PLACING YOUR COINS ON A SHELF Alt, Helmut; Buchin, Kevin; Chaplick, Steven; Cheong, Otfried; Kindermann, Philipp; Knauer, Christian; Stehn, Fabian, JOURNAL OF COMPUTATIONAL GEOMETRY, v.9, no.1, pp.312 - 327, 2018-12 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,774 2020 - 2024
- 5,388 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989