28 views

Uploaded by Figigo

© All Rights Reserved

- Computer Notes - Data Structures - 30
- Sudoku.docx
- tabu_TSP
- Ai Project Presentation
- COAMR
- Sample Exam 09
- PDDL
- And or or Compound Inequality
- Computer Notes - Data Structures - 14
- The Matiyasevich polynomial, four colour theorem and weight systems
- Implementation Dijkstra
- ellipse 2013
- Patterns WP Libre
- Quick
- Linear Bisection-Newton - Copy
- unit4.3 Calculus
- CN
- algebra 1 6 6 notes key
- 7.1 Polynomial Functions Review
- naivebayesTute

You are on page 1of 2

3-partition problem

The 3-partition problem is an NP-complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triples that all have the same sum. More precisely, given a multiset S of n = 3m positive integers, can S be partitioned into m subsets S1, S2, , Sm such that the sum of the numbers in each subset is equal? The subsets S1, S2, , Sm must form a partition of S in the sense that they are disjoint and they cover S. Let B denote the (desired) sum of each subset Si, or equivalently, let the total sum of the numbers in S be mB. The 3-partition problem remains NP-complete when every integer in S is strictly between B/4 and B/2. In this case, each subset Si is forced to consist of exactly three elements (a triple). The 3-partition problem is similar to the partition problem, which in turn is related to the subset sum problem. In the partition problem, the goal is to partition S into two subsets with equal sum. In 3-partition the goal is to partition S into m subsets (or n/3 subsets), not just three subsets, with equal sum.

Strong NP-completeness

The 3-partition problem remains NP-complete even when the integers in S are bounded above by a polynomial in n. In other words, the problem remains NP-complete even when representing the numbers in the input instance in unary. i.e., 3-partition is NP-complete in the strong sense or strongly NP-complete. This property, and 3-partition in general, is useful in many reductions where numbers are naturally represented in unary. In contrast, the partition problem is known to be NP-complete only when the numbers are encoded in binary, and have value exponential in n.

Descriptions

Garey and Johnson (1975) originally proved that 3-partition to be NP-complete, by a reduction from 3-dimensional matching. The classic reference by Garey and Johnson (1979) describes an NP-completeness proof, reducing from 3-dimensional matching to 4-partition to 3-partition. The 4-partition problem is an analog of 3-partition in which the goal is to partition a given set S into quadruples all with the same sum: precisely, the difference is that S now consists of n = 4m integers, each strictly between B/5 and B/3.

References

Garey, Michael R. and David S. Johnson (1979), Computers and Intractability; A Guide to the Theory of NP-Completeness. ISBN 0-7167-1045-5. Pages 96105 and 224. Garey, Michael R. and David S. Johnson (1975). "Complexity results for multiprocessor scheduling under resource constraints". SIAM Journal on Computing 4 (4): 397411. doi:10.1137/0204035 [1].

References

[1] http:/ / dx. doi. org/ 10. 1137%2F0204035

3-partition problem Source: https://en.wikipedia.org/w/index.php?oldid=544388670 Contributors: Edemaine, Mifter, PlasmaTime, Ryankaplan, Svick, Twri, Yworo, 4 anonymous edits

License

Creative Commons Attribution-Share Alike 3.0 //creativecommons.org/licenses/by-sa/3.0/

- Computer Notes - Data Structures - 30Uploaded byecomputernotes
- Sudoku.docxUploaded byPaul Gerald Manahan Sangalang
- tabu_TSPUploaded byBedadipta Bain
- Ai Project PresentationUploaded bypkilias
- COAMRUploaded byselva20
- Sample Exam 09Uploaded byBilboBagginses
- PDDLUploaded byGiuseppe Pace
- And or or Compound InequalityUploaded byArturo Sierra
- Computer Notes - Data Structures - 14Uploaded byecomputernotes
- The Matiyasevich polynomial, four colour theorem and weight systemsUploaded bybayareaking
- Implementation DijkstraUploaded byJoseBetancourt
- ellipse 2013Uploaded byapi-199670769
- Patterns WP LibreUploaded byJohn Kellden
- QuickUploaded byanon-216576
- Linear Bisection-Newton - CopyUploaded byNayr JT
- unit4.3 CalculusUploaded byChristoff Botha
- CNUploaded bySamridhie Gambhir
- algebra 1 6 6 notes keyUploaded byapi-331215565
- 7.1 Polynomial Functions ReviewUploaded byD Anandhi
- naivebayesTuteUploaded byAmit Chandak
- RosenDiscreteMath10.3,10.4StudentSolutionsUploaded byDouglas Naphas
- hw5Uploaded byTushar Gupta
- LINEAR PROGRAMMING.pptxUploaded byKwin Hazel Satiada
- 09-25-2013 - Search AlgorithmsUploaded bythebobak
- ai-ch4bUploaded byAli Abdullah Cheema
- An Algorithm for Performance Index OfUploaded byShaina Singh
- LALR1029Uploaded bykislaybokaro
- PROB1 LagrangeUploaded byYomar Guillen
- CP7111Uploaded byPandiaraj A
- SummaryUploaded bySushant Sanap

- Face (Sex) Book,''a new page''in the networkUploaded by4gen_1
- Codeforces Trainings s02e04Uploaded byAlhepSoftAlhep
- IBXtras DocumentationUploaded byCarlos Araújo
- PROFIBUS System Description3 EnglishUploaded byNathyvh
- Traffic Light ControllerUploaded byPrasanna Kumar
- Ocularis Recorder Configuration Manual(3)Uploaded byRodrigo Higuera
- ECBA V3 Question BankUploaded byAnonymous 8fkufrqa8
- ADB-handout (1)-1Uploaded byRiyad Tamam
- Lebanese Java User Group_ Simple CRUD Using JSF (Standard) and MySQL With Netbeans and TomcatUploaded byvijay729
- MainShaftTechPaperUploaded byjohnson_rego
- FiatUploaded bykenneth_mui
- Ways to Make Money Online in 2017Uploaded byzezo
- BMW 5 E46 FLUploaded bySalisbur
- Cuckoo Lover User ManualUploaded byAdam
- Dear Readers!Uploaded byapi-9404799
- FAQ DBMSUploaded byShashank Mohan
- Azure Branch OfficeUploaded bytzaraujo
- MiddleWare Technology Lab ManualUploaded bySuresh Raju
- SoapUploaded bymadhusoftech
- IOT AssesmentUploaded byarijit17
- kerio-control-adminguide-en-7.1.0-1573Uploaded byoldworm
- Mitsubishi Multimedia Control SystemUploaded byBrendon Peter
- SMV 5 User GuideUploaded bylionlikeman
- Siemens Sinumerik 840C Advanced ProgrammingUploaded byTom Bossens
- FEA News May 2008FEA News May 2008Uploaded bysagar1503
- 2VAA002415_-_en_S__Turbine_Control__CMM11_Condition_Monitoring_Module.pdfUploaded byanbarasan
- OPC SERVER IEC 61850Uploaded byMARCOM SRL
- BOP Basic Safety FunctionsUploaded byMohamedSadek
- 10 SudokuUploaded byTushar K Gohel
- Planned Maintenance.pdfUploaded byRamanjaneya goud