max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...

Field-Programmable Gate Arrays (FPGAs) are flexible and reusable circuits that can be easily reconfigured by the designer. One of the steps involved in the logic design with FPGA circuits is placement. In this step, the logic functions are assigned to specific cells of the circuit. In this paper we present a placement algorithm for FPGA circuits. In traditional min-cut based placement algorithm...

The influences of processing and storage on the quality indices and nutritional content of fresh-cut fruits were evaluated in comparison to whole fruits stored for the same duration but prepared on the day of sampling. Fresh-cut pineapples, mangoes, cantaloupes, watermelons, strawberries, and kiwifruits and whole fruits were stored for up to 9 days in air at 5 degrees C. The postcutting life ba...

The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics. Let n be the number of vertices and e be the number edges of G and let b(G) denote the size of the largest bipartite subgraph of G. The extremal part ...

We analyze the addition of a simple local improvement step to various known ran-domized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently known for the Max Cut problem on general graphs GW95]. We consider a semideenite relaxation of the Max Cut problem, round it using the random hyperplane rounding technique of ((GW95]), and then add a local improvement step....

This paper studies the existence of eecient (small size) ampliiers for proving explicit inaproximability results for bounded degree and bounded occurrence combinatorial optimization problems, and gives an explicit construction for such ampliiers. We use this construction to improve the currently best known approximation lower bounds for bounded occurrence instances of linear equations mod 2, an...

in order to examine the effects of essential oils and silver nanoparticles as anantimicrobial preservative in the solutions of alstroemeri cv. sukari cut flowers, anexperiment was conducted with 11 treatments and 3 replications in a completelyrandomized design. in this study, we used essences of carvacrol, thymol and zataria oilwithconcentrations of 50 and 100 mg l-1 and silver nanoparticles wi...

Metric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT has a polynomial time randomized approximation scheme.

BACKGROUND Non-communicable diseases (NCDs) are an important issue worldwide. Obesity has a close relationship with NCDs. Various age-related changes should be considered when evaluating obesity. METHODS National representative cohort data from the National Health Insurance Service National Sample Cohort from 2012 to 2013 were used. Sex-specific and age group-specific (10-year intervals) mean...