✦ LIBER ✦

A .699-approximation algorithm for Max-Bisection

✍ Scribed by Yinyu Ye

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 71 KB
Volume: 90
Category: Article
ISSN: 0025-5610
DOI: 10.1007/pl00011415

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new Lagrangian net algorithm for solvi

A new Lagrangian net algorithm for solving max-bisection problems

✍ Fengmin Xu; Xusheng Ma; Baili Chen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 211 KB

The max-bisection problem is an NP-hard combinatorial optimization problem. In this paper, a new Lagrangian net algorithm is proposed to solve max-bisection problems. First, we relax the bisection constraints to the objective function by introducing the penalty function method. Second, a bisection s

A 78-approximation algorithm for metric

A 78-approximation algorithm for metric Max TSP

✍ Refael Hassin; Shlomi Rubinstein 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 66 KB

We present a randomized approximation algorithm for the metric version of undirected Max TSP. Its expected performance guarantee approaches 7 8 as n → ∞, where n is the number of vertices in the graph.

Improved Approximation Algorithms for MA

Improved Approximation Algorithms for MAX SAT

✍ Takao Asano; David P. Williamson 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 215 KB

MAX SAT (the maximum s~tisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approxima~ tion algorithms for MAX SAT proposed by Goemans and Williamson and pze

A modified VNS metaheuristic for max-bis

A modified VNS metaheuristic for max-bisection problems

✍ Ai-fan Ling; Cheng-xian Xu; Le Tang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033-1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile that VNS metaheuristic is extended to solve ma

Approximation Algorithms for Min–Max Tre

Approximation Algorithms for Min–Max Tree Partition

✍ Nili Guttmann-Beck; Refael Hassin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 298 KB

We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP.

On Approximation Algorithms for Hierarch

On Approximation Algorithms for Hierarchical MAX-SAT

✍ Sameet Agarwal; Anne Condon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 232 KB

We prove upper and lower bounds on performance guarantees of approximation Ž . algorithms for the hierarchical MAX-SAT H-MAX-SAT problem. This problem is representative of a broad class of PSPACE-hard problems involving graphs, Boolean formulas, and other structures that are defined succinctly. Our