Results 1  10
of
38
Approximation Hardness of Bounded Degree MINCSP and MINBISECTION
 Proc. 29th ICALP
, 2001
"... We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MINLIN2 and a MINBISECTION problem for graphs. MINLIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that satisfies the minimum number of them. E3O ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MINLIN2 and a MINBISECTION problem for graphs. MINLIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that satisfies the minimum number of them. E3
Minimum Bisection is NPhard on Unit Disk Graphs
"... Abstract. In this paper we prove that the MinBisection problem is NPhard on unit disk graphs, thus solving a longstanding open question. ..."
Abstract
 Add to MetaCart
Abstract. In this paper we prove that the MinBisection problem is NPhard on unit disk graphs, thus solving a longstanding open question.
Approximation of Densen/2Subgraph and the Complement of MinBisection
, 1999
"... We consider the DENSEn/2SUBGRAPH problem, i.e., determine a block of half number nodes from a weighted graph such that the sum of the edge weights, within the subgraph induced by the block, is maximized. We prove that a strengthened semidefinite relaxation with a mixed rounding technique yields a ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
provably yields no more than:5 approximation. We also consider the complement of the graph MINBISECTION problem, i.e., partitioning the nodes into two blocks of equal cardinality so as to maximize the weights of noncrossing edges. We present a .602 approximation of the complement of MINBISECTION.
Approximation of Densen 2Subgraph andthe Complement of MinBisection \Lambda
, 1999
"... Abstract We consider the DENSE n2SUBGRAPH problem, i.e., determine a block of half number nodes from a weighted graph such that the sum of the edge weights, within the subgraph induced by the block, is maximized. We prove that a strengthened semidefinite relaxation with a mixed rounding technique ..."
Abstract
 Add to MetaCart
relaxation provably yields no more than:5 approximation. We also consider the complement of the graph MINBISECTION problem, i.e., partitioning the nodes into two blocks of equal cardinality so as to maximize the weights of noncrossing edges. We present a:602 approximation of the complement of MINBISECTION
Polynomial Time Approximation Schemes for MAXBISECTION on Planar and Geometric Graphs
"... The MaxBisection and MinBisection problems are to find a partition of the vertices of a graph into two equal size subsets that respectively maximizes or minimizes the number of edges with endpoints in both subsets. We design ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
The MaxBisection and MinBisection problems are to find a partition of the vertices of a graph into two equal size subsets that respectively maximizes or minimizes the number of edges with endpoints in both subsets. We design
.602 Approximation of the Complement of MinBisection and .519 Approximation of Densen/2Subgraph
, 1999
"... We consider the complement of the graph MINBISECTION problem, i.e., partitioning the nodes of a weighted graph into two blocks of equal cardinality so as to maximize the weights of noncrossing edges; and the DENSEn/2SUBGRAPH problem, i.e., determine a block of half nodes such that the weight wit ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We consider the complement of the graph MINBISECTION problem, i.e., partitioning the nodes of a weighted graph into two blocks of equal cardinality so as to maximize the weights of noncrossing edges; and the DENSEn/2SUBGRAPH problem, i.e., determine a block of half nodes such that the weight
A polynomial time approximation scheme for metric MINBISECTION
 ECCC
, 2002
"... We design a polynomial time approximation scheme (PTAS) for the problem of Metric MINBISECTION of dividing a given finite metric space into two halves so as to minimize the sum of distances across that partition. The method of solution depends on a new metric placement partitioning method which cou ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We design a polynomial time approximation scheme (PTAS) for the problem of Metric MINBISECTION of dividing a given finite metric space into two halves so as to minimize the sum of distances across that partition. The method of solution depends on a new metric placement partitioning method which
Ruling out PTAS for graph minbisection, dense ksubgraph, and bipartite clique
 SIAM J. Comput
"... Abstract Assuming that NP 6 ` "ffl?0 BPTIME(2nffl), we show that Graph MinBisection, Dense kSubgraph and Bipartite Clique have no Polynomial Time Approximation Scheme (PTAS). We give a reduction from the Minimum Distance of Code Problem (MDC). Starting with an instance of MDC, we build a Q ..."
Abstract

Cited by 57 (0 self)
 Add to MetaCart
Abstract Assuming that NP 6 ` "ffl?0 BPTIME(2nffl), we show that Graph MinBisection, Dense kSubgraph and Bipartite Clique have no Polynomial Time Approximation Scheme (PTAS). We give a reduction from the Minimum Distance of Code Problem (MDC). Starting with an instance of MDC, we build a
Belief propagation and spectral methods
, 2007
"... We investigate an algorithm derived based on the belief propagation method of Pearl [11] applied to the (Min)Bisection problem under the standard planted solution model (or more precisely the Most Likely Partition problem under the same planted solution model). We first point out that the algorithm ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate an algorithm derived based on the belief propagation method of Pearl [11] applied to the (Min)Bisection problem under the standard planted solution model (or more precisely the Most Likely Partition problem under the same planted solution model). We first point out
Between Min Cut and Graph Bisection
, 1991
"... We investigate a class of graph partitioning problems whose two extreme representatives are the wellknown Min Cut and Graph Bisection problems. The former is known to be efficiently solvable by flow techniques, the latter to be NPcomplete. The results presented in this paper are  a monotony res ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
We investigate a class of graph partitioning problems whose two extreme representatives are the wellknown Min Cut and Graph Bisection problems. The former is known to be efficiently solvable by flow techniques, the latter to be NPcomplete. The results presented in this paper are  a monotony
Results 1  10
of
38