ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Planted models for k-way edge and vertex expansion

Louis, A and Venkat, R (2019) Planted models for k-way edge and vertex expansion. In: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, 11-13 December 2019, Institute of Technology BombayBombay; India.

[img] PDF
lie_int_pro_inf_150_2019.pdf - Published Version
Restricted to Registered users only

Download (564kB)
Official URL: http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2019.23

Abstract

Graph partitioning problems are a central topic of study in algorithms and complexity theory. Edge expansion and vertex expansion, two popular graph partitioning objectives, seek a 2-partition of the vertex set of the graph that minimizes the considered objective. However, for many natural applications, one might require a graph to be partitioned into k parts, for some k > 2. For a k-partition S1,..., Sk of the vertex set of a graph G = (V, E), the k-way edge expansion (resp. vertex expansion) of S1,..., Sk is defined as maxi�k Φ(Si), and the balanced k-way edge expansion (resp. vertex expansion) of G is defined as min {S1,...,Sk}�Pk max i�k Φ(Si) , where Pk is the set of all balanced k-partitions of V (i.e each part of a k-partition in Pk should have cardinality |V |/k), and Φ(S) denotes the edge expansion (resp. vertex expansion) of S � V. We study a natural planted model for graphs where the vertex set of a graph has a k-partition S1,..., Sk such that the graph induced on each Si has large expansion, but each Si has small edge expansion (resp. vertex expansion) in the graph. We give bi-criteria approximation algorithms for computing the balanced k-way edge expansion (resp. vertex expansion) of instances in this planted model.

Item Type: Conference Paper
Publication: Leibniz International Proceedings in Informatics, LIPIcs
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Additional Information: Copyright of this article belongs to Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Keywords: Approximation algorithms; Computational complexity; Expansion; Silicon; Software engineering, Algorithms and complexity; Cardinalities; Edge expansion; Graph Partitioning; Graph partitioning problems; Semi-random models; Vertex expansions; Worst-case analysis, Graph theory
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 26 Feb 2020 10:13
Last Modified: 26 Feb 2020 10:13
URI: http://eprints.iisc.ac.in/id/eprint/64372

Actions (login required)

View Item View Item