Original title: Silné souvislé Steinerovské podgrafy s malým počtem Steinerovských vrcholů
Translated title: Strongly Connected Steiner Subgraphs with small number of Steiner vertices
Authors: Kemény, Tamás Dávid ; Feldmann, Andreas Emil (advisor) ; Suchý, Ondřej (referee)
Document type: Bachelor's theses
Year: 2020
Language: eng
Abstract: Title: Strongly Connected Steiner Subgraphs with Small Number of Steiner Vertices Author: Tamás Dávid Kemény Department: Department of Applied Mathematics Supervisor: Dr. Andreas Emil Feldmann, Department of Applied Mathematics Abstract: Two well-established methods of dealing with hard optimization problems have been to develop approximation and parameterized algorithms. Recent results have shown that for some problems, it is only by combining these two approaches, into so-called pa- rameterized approximation algorithms, that we are able to efficiently find solutions that are of reasonable quality. This is the viewpoint from which we study the problem known as the Strongly Connected Steiner Subgraph problem, where a set of terminal vertices of an edge-weighted directed graph needs to be strongly-connected in the cheapest way possible. Keywords: Strongly Connected Steiner Subgraphs, Parameterized Algorithms, Approxi- mation Algorithms, Bidirected Graphs iii
Keywords: approximation algorithms; bidirected graphs; parameterized algorithms; strongly-connected Steiner subgraphs

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/116915

Permalink: http://www.nusl.cz/ntk/nusl-410910


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Bachelor's theses