Given a directed graph G and an edge weight function w : E(G) → R+, the maximum directed cut problem (max dicut) is that of finding a directed cut δ(X) with maximum total weight. In this paper we consider a version of max dicut — max dicut with given sizes of parts or max dicut with gsp — whose instance is that of max dicut plus a positive integer p, and it is required to find a directed cut δ(...

The efficiency and uniqueness of the diffusive shock acceleration is studied on the basis of the novel kinetic solutions. These solutions obtained earlier (paper I) selfconsistently describe a strong coupling of cosmic rays with the gas flow. They show that the dependence of the acceleration efficiency upon physical parameters is critical in nature. In this paper we investigate a steady acceler...

Given a graph G on a vertex set V , MaxCut is the problem of finding a partition of V so that the number of edges cut is as large as possible. MaxCut has a simple random approximation algorithm. Given a graph G = (V,E), output a random partition (R,B) of V . Specifically, for each vertex v ∈ V , put v in R or B with probability 1 2 . Theorem 3. The expected number of edges cut by this algorithm...

This paper provides insight to the topic of cut-through paths in a layer two network. Cut-through paths make it possible to switch traffic more efficiently through the network and lessen the load on certain network components. The paper describes the encountered problems, protocols and technics and solutions with regard to the automatic creation of cut-through paths within the AMS-IX network. A...

this study was carried out to investigate the effect of differentpreservative solutions to improve the keeping quality of tuberose (polianthes tuberosa cv. single). these preservative solutions (treatments) were: t1= 2% sucrose + 200 mg/l agno3, t2= 2% sucrose + 200 mg/l agno3 + 25 mg/l citric acid, t3= 2% sucrose + 300 mg/l hqs, t4 = 2% sucrose + 300 mg/l hqs+ 25 mg/l citric acid, t5= 2% sucro...

In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both the cut and the maximum subdomain degree are simultaneously minimized. This type of partitionings are critical for existing and emerging applications in VLSI CAD as they allow to both minimize and evenly distribute the i...

In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both the cut and the maximum subdomain degree are simultaneously minimized. This type of partitionings are critical for existing and emerging applications in VLSI CAD as they allow to both minimize and evenly distribute the i...

Understanding finite-size effects is one of the key open questions in solving planar AdS/CFT. In this paper we discuss these effects in the AdS5×S string theory at one-loop in the world-sheet coupling. First we provide a very general, efficient way to compute the fluctuation frequencies, which allows to determine the energy shift for very general multi-cut solutions. Then we apply this to two-c...