We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimization problem: on query S ⊂ V , the oracle returns the size of the cut between S and V \ S. We provide algorithms computing an exact minimum s-t cut in G with Õ(n5/3) queries, and computing an exact global minimum cut ...

The purpose of this paper is to illustrate a general framework for network location problems, based on column generation and branch-andprice. In particular we consider capacitated network location problems with single-source constraints. We consider several different network location models, by combining cardinality constraints, fixed set-up costs, concentrator restrictions and regional constra...

in this study, the application of gray relational analysis (gra) and taguchi method in multi-criteria process parameters selection of turning operation has been investigated. the process responses under study are material removal rate (mrr) and surface roughness (sr); in turn, the input parameters include cutting speed, feed rate, depth of cut and nose radius of the cutting tool. the proposed a...

the suppression of the regenerative chatter phenomenon in turning process via the variation of the frequency and amplitude of the spindle motor excitation is carried out in this research. a programmable inverter is employed for variable periodic excitation of the spindle motor. a set of turning experiments is designed and performed on a number of conical work pieces both in constant spindle spe...

Let (G, T ) be an instance of the (vertex) multiway cut problem where G is a graph and T is a set of terminals. For t ∈ T , a set of nonterminal vertices separating t from T \ {T } is called an isolating cut of t. The largest among all the smallest isolating cuts is a natural lower bound for a multiway cut of (G, T ). Denote this lower bound by m and let k be an integer. In this paper we propos...

Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...