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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

With a computer-aided approach based on the connection with equitable partitions, we establish the uniqueness of the orthogonal…

2014

In this paper, we study the complexity of an autonomous vehicle sequencing problem under the framework of Autonomous Intersection…

2013

The 3-partition problem admits a straightforward formulation as a 0-1 Integer Linear Program (ILP). We investigate problem…

2009

The historical research line on the algebraic properties of structured CF languages initiated by McNaughton's Parenthesis…

2008

Although there are polynomial algorithms of finding a 2-partition or a 3-partition for a simple undirected 2-connected or 3…

2007

A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We…

2005

Two-level thresholding segments a gray scale image into two parts: object and background. This two-class segmentation is not…

2004

Les nouveaux supports d'execution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative…

2004

Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition…

1996

Underlying proposals to alter the specialty distribution of the U.S. physician workforce is the tacit assumption that physicians…