Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,766 papers from all fields of science
Search
Sign In
Create Free Account
3-partition problem
Known as:
3-partition
, Three processor problem
, Unary 3-partition
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
3-dimensional matching
Computer science
List of NP-complete problems
Michael Garey
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the orthogonal arrays of parameters OA(1536, 13, 2, 7) and related
D. Krotov
arXiv.org
2019
Corpus ID: 166227975
With a computer-aided approach based on the connection with equitable partitions, we establish the uniqueness of the orthogonal…
Expand
2018
2018
R-BBG2: Recursive Bipartition of Bi-connected Graphs
Ngoc-Tu Nguyen
,
Zhi-Li Zhang
arXiv.org
2018
Corpus ID: 53099127
Given an undirected graph $G(V, E)$, it is well known that partitioning a graph $G$ into $q$ connected subgraphs of equal or…
Expand
2014
2014
A polynomial time heuristic algorithm for certain instances of 3-partition
Ronald D. Smith
2014
Corpus ID: 120102384
THESIS: A Polynomial Time Heuristic Algorithm for Certain Instances of 3-Partition STUDENT: Ronald Douglas Smith DEGREE: Master…
Expand
2014
2014
CMSC 858 F : Algorithmic Lower Bounds Fall 2014 Puzzles and Reductions from 3-Partition Instructor :
M. Hajiaghayi
2014
Corpus ID: 11729521
In this lecture, we first examine several classes of NP-hardness and polynomial time algorithms which arise from differences in…
Expand
2013
2013
Relaxation of 3-partition instances
S. Joosten
,
H. Zantema
Cologne Twente Workshop on Graphs and…
2013
Corpus ID: 29208295
The 3-partition problem admits a straightforward formulation as a 0-1 Integer Linear Program (ILP). We investigate problem…
Expand
2013
2013
An Efficient Parallel Algorithm for Solving the 3-Partition Problem Based On ADI
Tahere Panahi
,
T. Heidari
,
V. S. Naeini
2013
Corpus ID: 14547592
The three-partition problem is one of the most famous strongly NP-complete combinatorial problems. Most of the recently proposed…
Expand
2012
2012
A New Bit Wise Technique for 3-Partitioning Algorithm
Rajkumar Jain
,
N. S. Chaudhari
2012
Corpus ID: 61761004
From last five decades peoples are working on Partitioning problem. Partitioning is a fundamental problem with applications in…
Expand
2005
2005
Fuzzy Partition Technique in Three-Level Thresholding
2005
Corpus ID: 18034618
Two-level thresholding segments a gray scale image into two parts: object and background. This two-class segmentation is not…
Expand
2004
2004
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution. (Scheduling algorithms for parallel platforms)
Pierre-François Dutot
2004
Corpus ID: 12039210
Les nouveaux supports d'execution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative…
Expand
2004
2004
Partition a graph with small diameter into two induced matchings
Ai-Feng Yang
,
Jinjiang Yuan
2004
Corpus ID: 189908571
Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition…
Expand