| Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2014: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Outline of Final Research Achievements |
We consider a problem that generalizes the famous Huffman Tree Problem by associating each leaf with an arbitrary function. If the functions are all linear, then the problem can be solved in polynomial time by Huffman's algorithm. On the other hand, it is known that the problem is NP-hard for general functions. We design a polynomial-time algorithm for the case of unit step functions. Moreover, we show limitations in improvement of algorithms for several related optimization problems.
|
