|
| Keyword : NP-hard
| |
|
Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration
Masayuki TAKEDA Nobuyuki YAMASAKI | Publication:
Publication Date: 2020/10/01
Vol. E103-A
No. 10 ;
pp. 1227-1233
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: communication
Keyword:
4b/10b, NP-hard, maximum clique enumeration, | | | Summary | Full Text:PDF | |
|
Visibility Problems for Manhattan Towers
Chuzo IWAMOTO Yusuke KITAGAKI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/03/01
Vol. E99-D
No. 3 ;
pp. 607-614
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---Developments of the Theory of Algorithms and Computation---)
Category:
Keyword:
guarding problem, Manhattan towers, NP-hard, | | | Summary | Full Text:PDF | |
|
Maximizing the Total Weight of Just-In-Time Jobs under Multi-Slot Conditions Is NP-Hard
Eishi CHIBA Shinji IMAHORI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/02/01
Vol. E99-D
No. 2 ;
pp. 525-528
Type of Manuscript:
LETTER
Category: Fundamentals of Information Systems
Keyword:
scheduling, just-in-time, time slot, weight, NP-hard, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
Inapproximability of the Minimum Biclique Edge Partition Problem
Hideaki OTSUKI Tomio HIRATA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/02/01
Vol. E93-D
No. 2 ;
pp. 290-292
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science)
Category:
Keyword:
biclique, edge partition, NP-hard, inapproximability, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
|
Wireless ATM Backbone Network Design Problem
Der-Rong DIN | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/07/01
Vol. E88-A
No. 7 ;
pp. 1777-1785
Type of Manuscript:
Special Section PAPER (Special Section on Multi-dimensional Mobile Information Networks)
Category: Network
Keyword:
wireless ATM, heuristic algorithm, genetic algorithm, NP-hard, backbone network, | | | Summary | Full Text:PDF | |
| |
| |
|
Hybrid Method for Solving Dual-Homing Cell Assignment Problem on Two-Level Wireless ATM Network
Der-Rong DIN | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/07/01
Vol. E87-A
No. 7 ;
pp. 1664-1671
Type of Manuscript:
Special Section PAPER (Special Section on Multi-dimensional Mobile Information Networks)
Category: Network Theory
Keyword:
NP-hard, wireless ATM, cell assignment, dual-homing, simulated annealing, heuristic algorithm, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
|