The Bisection problem asks for a partition of the vertices of a graph into two equally sized sets, while minimizing the cut size. This is the number of edges connecting the two vertex sets. Bisection has been thoroughly studied in the past. However, only few results have been published that consider the parameterized complexity of this problem. We show that Bisection is FPT w.r.t. the minimum c...

This study aims to compare the price cut and premium promotion with moderators are discount depth size, product type, characteristics, country effect (Indonesia Taiwan). The experiment was designed as: (promotional / cut) x 2 (discount size: high low) (product type: hedonic utilitarian) (country effect: Indonesia Taiwan) promotion) (premium characteristics: related unrelated) Total of 12 groups...

OBJECTIVE In public health and health services research, the inclusion of geographic information in data sets is critical. Because of concerns over the re-identification of patients, data from small geographic areas are either suppressed or the geographic areas are aggregated into larger ones. Our objective is to estimate the population size cut-off at which a geographic area is sufficiently la...

A new parametric model was developed for predicting cut point of hydraulic classifiers. The model directly uses operating parameters including pulp flowrate, feed particle size characteristics, pulp solids content, solid density and particles retention time in the classification chamber and also covers uncontrollable errors using calibration constants. The model applicability was first verified...

background: in myocardial perfusion spect imaging, images are degraded by photon attenuation, the distance-dependent collimator, detector response and photons scatter. filters greatly affect quality of nuclear medicine images materials and methods: a phantom simulating heart left ventricle was built. about 1mci of 99mtc was injected into the phantom. images were taken from this phantom. some fi...

a new parametric model was developed for predicting cut point of hydraulic classifiers. the model directly uses operating parameters including pulp flowrate, feed particle size characteristics, pulp solids content, solid density and particles retention time in the classification chamber and also covers uncontrollable errors using calibration constants. the model applicability was first verified...

In this paper, we study the problem of approximating the minimum cut in a distributed message-passing model, the CONGEST model. The minimum cut problem has been well-studied in the context of centralized algorithms. However, there were no known non-trivial algorithms in the distributed model until the recent work of Ghaffari and Kuhn. They gave algorithms for finding cuts of size O(ǫλ) and (2 +...

We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subset of the vertices. The size of a cluster is defined as the total vertex weight in the subset plus the total edge weight at the boundary of the cluster. The bounded size graph clustering problem (BSGC) is to partition ...

An effective continuous algorithm is proposed to find approximate solutions of NP-hard max-cut problems. The algorithm relaxes the max-cut problem into a continuous nonlinear programming problem by replacing n discrete constraints in the original problem with one single continuous constraint. A feasible direction method is designed to solve the resulting nonlinear programming problem. The metho...