Approximation Algorithms for Min-k-overlap英文电子资料.pdfVIP

Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach H Narayanan I, Subir Roy 2, and Sachin Patkar a 1 Deptt. of Elec. Engg., IIT, Bombay 400076, INDIA 2 Deptt. of Elec. Engg., IIT Kanpur, 208016, INDIA 3 Forschungsinstitut ffir Diskrete Mathematik, Universits Bonn, Germany 1 Introduction In this paper we discuss strategies for constructing approximate algorithms for solvir/g the Min-k-cut problem, the Min-k-vertex sharing problem and their generalization the Min-k-overlap problem. In each case, we first formulate an appropriate submodular function and construct its Principal Lattice of Partitions (PLP) [11]. Applying an elementary strategy on an appropriate subinterval of the PLP yields the approximate algorithms. We state the Min-k-cu t Min-k-ver~ex sharing, and the Min-k-overlap prob- lems. Let G be a graph with nonnegative weights on the edges. M i n - k - c u t P r o b l e m : Partition the vertex set V(G) of G into k subsets such that the sum of the weights of edges whose endpoints lie in different blocks is a minimum. M i n - k - v e r t e x s h a r i n g P r o b l e m : Partition the edge set E(G) of G into k subsets such that the sum of the weights of vertices shared between subsets is minimised. This problem has two variations. V e r t e x s h a r i n g (1) : Count each vertex shared between t blocks (t - 1) times. V e r t e x s h a r i n g (2) : Here a shared vertex is counted only once. M i n - k - o v e r l a p P r o b l e m : Let p be a polymatroid rank f