Results 1  10
of
719,093
Approximation algorithms for the bicriteria weighted maxcut problem
 Discrete Applied Mathematics
"... Abstract. We consider a generalization of the classical maxcut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and the nonexistence of feasible cuts that are at the same time near optimal for both criteria. Furthermore, two approximatio ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We consider a generalization of the classical maxcut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and the nonexistence of feasible cuts that are at the same time near optimal for both criteria. Furthermore, two
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1311 (54 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Approximation Algorithm for the MaxCut Problem
 Combinatorics, Probability and Computing
, 1993
"... In this project, we investigated several approximation algorithms for the MaxCut problem. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this project, we investigated several approximation algorithms for the MaxCut problem.
An Efficient Approximation Algorithm for MaxCut
"... Significant research effort has been devoted in the study of approximation algorithms for NPhard problems. Approximation algorithm for MaxCut problem with performance guarantee of 0.87856 is long known. In this work we study balanced MaxCut problem. We give a balancing factor β for given α such t ..."
Abstract
 Add to MetaCart
Significant research effort has been devoted in the study of approximation algorithms for NPhard problems. Approximation algorithm for MaxCut problem with performance guarantee of 0.87856 is long known. In this work we study balanced MaxCut problem. We give a balancing factor β for given α
An Investigation of the MaxCut Problem
, 2004
"... The MaxCut problem seeks to partition the vertices of a graph into two sets such that the weight of the edges joining those sets is maximized. The MaxCut problem has been of continued research interest and has developed an extensive literature. After reviewing of a small portion of that literature, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The MaxCut problem seeks to partition the vertices of a graph into two sets such that the weight of the edges joining those sets is maximized. The MaxCut problem has been of continued research interest and has developed an extensive literature. After reviewing of a small portion of that literature
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
Maxcut Problem
, 2007
"... Maxcut problem is one of many NPhard graph theory problems which attracted many researchers over the years. Though there is almost no hope in finding a polynomialtime algorithm for maxcut problem, various heuristics, or combination of optimization and heuristic methods have been developed to solv ..."
Abstract
 Add to MetaCart
Maxcut problem is one of many NPhard graph theory problems which attracted many researchers over the years. Though there is almost no hope in finding a polynomialtime algorithm for maxcut problem, various heuristics, or combination of optimization and heuristic methods have been developed
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Results 1  10
of
719,093