Results 1  10
of
12,803
Linearshaped partition problems
, 2000
"... We establish the polynomialtime solvability of a class of vector partition problems with linear objectives subject to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We establish the polynomialtime solvability of a class of vector partition problems with linear objectives subject to
PARTITIONING PROBLEMS IN DENSE HYPERGRAPHS
"... We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma [16] and its algorithmic version proved in [5], we give polynomial time approximation schemes for the general partitioning problem and for the discrepancy problem. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma [16] and its algorithmic version proved in [5], we give polynomial time approximation schemes for the general partitioning problem and for the discrepancy problem.
On a DAG partitioning problem
 IN PROC. 9TH WAW, VOLUME 7323 OF LNCS
, 2012
"... We study the following DAG Partitioning problem: given a directed acyclic graph with arc weights, delete a set of arcs of minimum total weight so that each of the resulting connected components has exactly one sink. We prove that the problem is hard to approximate in a strong sense: If P 6 = NP th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the following DAG Partitioning problem: given a directed acyclic graph with arc weights, delete a set of arcs of minimum total weight so that each of the resulting connected components has exactly one sink. We prove that the problem is hard to approximate in a strong sense: If P 6 = NP
Complexity of Graph Partition Problems
 31ST ANNUAL ACM STOC
, 1999
"... We introduce a parametrized family of graph problems that includes several wellknown graph partition problems as special cases. We develop tools which allow us to classify the complexity of many problems in this family, and in particular lead us to a complete classification for small values of the ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
We introduce a parametrized family of graph problems that includes several wellknown graph partition problems as special cases. We develop tools which allow us to classify the complexity of many problems in this family, and in particular lead us to a complete classification for small values
Clustering and the Biclique Partition Problem
"... A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary matrices can be viewed as adjacency matrices of bipartite graphs, the problem is equivalent to partitioning a bipartite graph ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary matrices can be viewed as adjacency matrices of bipartite graphs, the problem is equivalent to partitioning a bipartite graph
The meanpartition problem
, 2006
"... In meanpartition problems the goal is to partition a finite set of elements, each associated with a dvector, into p disjoint parts so as to optimize an objective, which depends on the averages of the vectors that are assigned to each of the parts. Each partition is then associated with a d × p ma ..."
Abstract
 Add to MetaCart
In meanpartition problems the goal is to partition a finite set of elements, each associated with a dvector, into p disjoint parts so as to optimize an objective, which depends on the averages of the vectors that are assigned to each of the parts. Each partition is then associated with a d × p
On Uniform kPartition Problems
"... We study various uniform kpartition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems di#er according to the particular measure of "set uniformity ..."
Abstract
 Add to MetaCart
We study various uniform kpartition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems di#er according to the particular measure of "
The asymmetric matrix partition problem
, 2012
"... An instance of the asymmetric matrix partition problem consists of a matrix A ∈ R n×m + and a probability distribution p over its columns. The goal is to find a partition scheme that maximizes the resulting partition value. A partition scheme S = {S1,..., Sn} consists of a partition Si of [m] for e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
An instance of the asymmetric matrix partition problem consists of a matrix A ∈ R n×m + and a probability distribution p over its columns. The goal is to find a partition scheme that maximizes the resulting partition value. A partition scheme S = {S1,..., Sn} consists of a partition Si of [m
Simulation as Coarsest Partition Problem
, 2002
"... The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure. Such an equivalence has suggested efficient algorithms for the computation of the maximal bisimulation ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure. Such an equivalence has suggested efficient algorithms for the computation of the maximal bisimulation
The Area Partitioning Problem
, 2000
"... Given an arbitrary polygon with n vertices, we wish to partition it into p connected pieces of given areas. The problem is motivated by a robotics application in which the polygon is a workspace that is to be divided among p robots performing a terraincovering task. We show that nding an area parti ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Given an arbitrary polygon with n vertices, we wish to partition it into p connected pieces of given areas. The problem is motivated by a robotics application in which the polygon is a workspace that is to be divided among p robots performing a terraincovering task. We show that nding an area
Results 1  10
of
12,803