Parameterized Algorithms for Graph Partitioning Problems

We study a broad class of graph partitioning problems. Each problem is defined by two constants, α 1 and α 2 . The input is a graph G , an integer k and a number p , and the objective is to find a subset U ⊆ V of size k , such that α 1 m 1 + α 2 m 2 is at most (or at least) p , where m 1 , m 2 are t...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 61; no. 3; pp. 721 - 738
Main Authors:	Shachnai, Hadas, Zehavi, Meirav
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2017 Springer Nature B.V
Subjects:	Algorithms Computer Science Parameterization Partitioning Theory of Computation Traveling salesman problem Graph partitioning Parameterized algorithm Representative family Random separation
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!