Results 1  10
of
2,107,347
Approximation Algorithms for Minimum Kcut
"... Let G = (V; E) be a complete undirected graph, with node set V = fv 1 ; : : : ; v n g and edge set E. The edges (v i ; v j ) 2 E have nonnegative weights that satisfy the triangle inequality. Given a set of integers K = fk i g p i=1 ( P p i=1 k i jV j), the minimum Kcut problem is to compute d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let G = (V; E) be a complete undirected graph, with node set V = fv 1 ; : : : ; v n g and edge set E. The edges (v i ; v j ) 2 E have nonnegative weights that satisfy the triangle inequality. Given a set of integers K = fk i g p i=1 ( P p i=1 k i jV j), the minimum Kcut problem is to compute
Finding kcuts within Twice the Optimal
, 1995
"... Two simple approximation algorithms for the minimum kcut problem are presented. Each algorithm finds a kcut having weight within a factor of (2 \Gamma 2=k) of the optimal. One of our algorithms is particularly efficient  it requires a total of only n \Gamma 1 maximum flow computations for find ..."
Abstract

Cited by 48 (2 self)
 Add to MetaCart
Two simple approximation algorithms for the minimum kcut problem are presented. Each algorithm finds a kcut having weight within a factor of (2 \Gamma 2=k) of the optimal. One of our algorithms is particularly efficient  it requires a total of only n \Gamma 1 maximum flow computations
Approximating a Parallel Task Schedule Using Minimum KCut
, 2003
"... Presented are two new approximation algorithms for solving two different NPhard graph problems. The first is the minimum kcut problem. The new algorithm runs within the same time complexity as the current bestknown algorithm and may have equal or better performance given any input. The second new ..."
Abstract
 Add to MetaCart
Presented are two new approximation algorithms for solving two different NPhard graph problems. The first is the minimum kcut problem. The new algorithm runs within the same time complexity as the current bestknown algorithm and may have equal or better performance given any input. The second
The Steiner kcut problem
, 2006
"... We consider the Steiner kcut problem which generalizes both the kcut problem and the multiway cut problem. The Steiner kcut problem is defined as follows. Given an edgeweighted undirected graph G =(V,E), a subset of vertices X ⊆ V called terminals, and an integer k ≤X, the objective is to find ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We consider the Steiner kcut problem which generalizes both the kcut problem and the multiway cut problem. The Steiner kcut problem is defined as follows. Given an edgeweighted undirected graph G =(V,E), a subset of vertices X ⊆ V called terminals, and an integer k ≤X, the objective
Finding k cuts within twice the optimal
 SIAM Journal on Computing
, 1995
"... Abstract. Two simple approximation algorithms for the minimum kcut problem are presented. Each algorithm finds a k cut having weight within a factor of (2 2/k) of the optimal. One algorithm is particularly efficientit requires a total of only n maximum flow computations for finding a set of near ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
Abstract. Two simple approximation algorithms for the minimum kcut problem are presented. Each algorithm finds a k cut having weight within a factor of (2 2/k) of the optimal. One algorithm is particularly efficientit requires a total of only n maximum flow computations for finding a set of near
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Improved Approximation Algorithms for MAX kCUT and MAX BISECTION
, 1994
"... Polynomialtime approximation algorithms with nontrivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks ..."
Abstract

Cited by 182 (0 self)
 Add to MetaCart
Polynomialtime approximation algorithms with nontrivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks
Minimum Error Rate Training in Statistical Machine Translation
, 2003
"... Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training cri ..."
Abstract

Cited by 663 (7 self)
 Add to MetaCart
Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Results 1  10
of
2,107,347