𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectral bounds for the maximum cut problem

✍ Scribed by Walid Ben-Ameur; José Neto

Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
107 KB
Volume
52
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Bounds for the Maximum Acyclic Sub
Tight Bounds for the Maximum Acyclic Subgraph Problem
✍ Bonnie Berger; Peter W Shor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph

Bounds for the cardinality constrained P
Bounds for the cardinality constrained P∥Cmax problem
✍ Mauro Dell'Amico; Silvano Martello 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 150 KB

We consider the generalization of the classical P Cmax problem arising when a given limit k is imposed on the number of jobs that can be assigned to any machine. This generalization has practical interest in the optimization of assembly lines for printed circuit boards (PCB). The problem is strongly

Optimal Bounds for the Predecessor Probl
Optimal Bounds for the Predecessor Problem and Related Problems
✍ Paul Beame; Faith E. Fich 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved f

A Simple Algorithm for the Planar Multiw
A Simple Algorithm for the Planar Multiway Cut Problem
✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota