Luca Trevisan [1] presented an approximation algorithm for Max Cut based on spectral partitioning techniques. He proved that the algorithm has an approximation ratio of at least 0.531. We improve this bound up to 0.6142. We also define and extend this result for the more general Maximum Colored Cut problem.

We introduce necessary and sufficient conditions for a (single-conclusion) sequent calculus to admit (reductive) cut-elimination. Our conditions are formulated both syntactically and semantically.

in the open-pit mining, one of the first decisions that must be made in production planning stage, after completing the design of final pit limits, is determining of the processing plant cut-off grade. since this grade has an essential effect on operations, choosing the optimum cut-off grade is of considerable importance. different goals may be used for determining optimum cut-off grade. one of...

The ultra-precision diamond cutting process exhibits strong size effects due to the ultra-small depth of cut that is comparable with the cutting edge radius. In the present work, we elucidate the underlying machining mechanisms of single crystal cerium under diamond cutting by means of molecular dynamics simulations, with an emphasis on the evaluation of the effect of depth of cut on the cuttin...

nuclear level densities and spin cut-off factors have been deduced for nuclei in the mass region 24‹a‹63,from a microscopic theory, which includes nuclear pairing interaction. single particle levels for both seeger and nilsson potentials were used in the calcdations. level densities extracted from the theory are compared with their conesponding experimental values, it is found that the overall ...

We study max-cut in classes of graphs defined by forbidding a single graph as a subgraph, induced subgraph, or minor. For the first two containment relations, we prove dichotomy theorems. For the minor order, we show how to solve max-cut in polynomial time for the class obtained by forbidding a graph with crossing number at most one (this generalizes a known result for K5-minor-free graphs) and...

This paper evaluates a new branch-and-cut approach, establishing a computational benchmark for the single-product, assembly system design (SPASD) problem. Our approach, which includes a heuristic, preprocessing, and two cut-generating methods, outperformed OSL in solving a set of 102 instances of the SPASD problem. The approach is robust; test problems show that it can be applied to variations ...