Li, Jianbo and Ding, Honglin (2013) Approximation Schemes for the 3-Partitioning Problems. Communications and Network, 05 (01). pp. 90-95. ISSN 1949-2421
![[thumbnail of CN_2013110709304083.pdf]](http://repository.journal4submission.com/style/images/fileicons/text.png)
Text
CN_2013110709304083.pdf - Published Version
Download (258kB)
Official URL: https://doi.org/10.4236/cn.2013.51B021
Abstract
The 3-partitioning problem is to decide whether a given multiset of nonnegative integers can be partitioned into triples that all have the same sum. It is considerably used to prove the strong NP-hardness of many scheduling problems. In this paper, we consider four optimization versions of the 3-partitioning problem, and then present four polynomial time approximation schemes for these problems.
| Item Type: | Article |
|---|---|
| Subjects: | Journal Eprints > Computer Science |
| Depositing User: | Managing Editor |
| Date Deposited: | 13 Dec 2022 10:11 |
| Last Modified: | 20 Mar 2024 04:21 |
| URI: | http://repository.journal4submission.com/id/eprint/581 |
Actions (login required)
- View Item