In this paper, we consider the inverse spanning tree problem. Given an undi0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tree with respect to the < < < < cost vector d and the cost of perturbation given by d y c s Ý d y c i...

Shape matrix decomposition is a subproblem in radiation therapy planning. A given fluence matrix A has to be written as a sum of shape matrices corresponding to homogeneous fields that can be shaped by a multileaf collimator (MLC). We solve the problem to find an approximation B of A satisfying prescribed upper and lower bounds for each entry. The approximation B is determined such that the cor...

The following algorithm partitions road networks surprisingly well: (i) sort the vertices by longitude (or latitude, or some linear combination) and (ii) compute the maximum flow from the first k nodes (forming the source) to the last k nodes (forming the sink). Return the corresponding minimum cut as an edge separator (or recurse until the resulting subgraphs are sufficiently small).

The present study addresses comparison of two analysis methods of voice production, inverse filtering and videokymography (VKG). Speech data were collected from two male speakers using sustained phonation during laryngoscopy (sound corresponding approximately to the vowel /ä/). The type of phonation was varied between breathy, normal, and pressed. From the waveforms given by inverse filtering, ...

The present paper examines the task of minimum cost flow finding in a fuzzy dynamic network with lower flow bounds. The distinguishing feature of this problem statement lies in the fuzzy nature of the network parameters, such as flow bounds, transmission costs and transit times. The arcs of the considered network have lower bounds. Another feature of this task is that fuzzy flow bounds, costs a...

We have sampled the artist social network of Myspace and to it applied the pairwise relational connectivity measure Minimum cut/Maximum flow. These values are then compared to a pairwise acoustic Earth Mover’s Distance measure and the relationship is discussed. Further, a means of constructing playlists using the maximum flow value to exploit both the social and acoustic distances is realized.

In this paper a data-driven methodology based on the Virtual Reference Feedback Tuning is presented for the tuning of Internal Model Controllers. A data based test is presented to check the robust stability of the controller in the loop, taking advantage of the control structure. Two different examples are shown where the presented method successfully controls a non-minimum phase discrete time ...

It is well-known how to use maximum flow to decide when a flow problem with demands, lower bounds, and upper bounds is infeasible. Less well-known is how to compute a flow that is least infeasible. This paper considers many possible ways to define “least infeasible” and shows how to compute optimal flows for each definition. For each definition it also gives a dual characterization in terms of ...

We consider the CONGEST model on a network with n nodes, m edges, diameter D, and integer costs capacities bounded by $${{\,\textrm{poly}\,}}n$$ . In this paper, we show how to find an exact solution minimum cost flow problem in $$n^{1/2+o(1)}(\sqrt{n}+D)$$ rounds, improving state of art algorithm running time $$m^{3/7+o(1)}(\sqrt{n}D^{1/4}+D)$$ [16], which only holds for special case unit capa...