The Complexity of Minimum Ratio Spanning Tree Problems |
| |
Authors: | Christopher C Ski?cim Susan W Palocsay |
| |
Institution: | (1) Lion Technologies, Inc., 1921 Thurston Road, Comus, MD 20842, USA;(2) Information Technology and Management Science Program, James Madison University, Harrisonburg, VA 22087, USA |
| |
Abstract: | We examine the complexity of two minimum spanning tree problems with rational objective functions. We show that the Minimum Ratio Spanning Tree problem is NP-hard when the denominator is unrestricted in sign, thereby sharpening a previous complexity result. We then consider an extension of this problem where the objective function is the sum of two linear ratios whose numerators and denominators are strictly positive. This problem is shown to be NP-hard as well. We conclude with some results characterizing sufficient conditions for a globally optimal solution. |
| |
Keywords: | Combinatorial optimization Fractional programming NP-hard |
本文献已被 SpringerLink 等数据库收录! |
|