DSpace at KOASAS
Browsing DSpace

Browse by Subject NP-hardness

A to Z

All 0-9

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:

Showing results 1 to 4 of 4

1
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

2
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

3
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube

Lee, Dabeen, DISCRETE OPTIMIZATION, v.32, pp.11 - 18, 2019-05

4
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

rss_1.0 rss_2.0 atom_1.0