Abstract
The k-sum optimization problem (KSOP) is the combinatorial problem of finding a solution such that the sum of the weights of the k largest weighted elements of the solution is as small as possible. KSOP simultaneously generalizes both bottleneck and minsum problems. We show that KSOP can be solved in polynomial time whenever an associated minsum problem can be solved in polynomial time. Further we show that if the minsum problem is solvable by a polynomial time ε-approximation scheme then KSOP can also be solved by a polynomial time ε-approximation scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
