Search Results - "Parameterized approximation algorithms"

Parameterized approximation algorithms for weighted vertex cover by Mandal, Soumen, Misra, Pranabendu, Rai, Ashutosh, Saurabh, Saket

“…A vertex cover of a graph is a set of vertices of the graph such that every edge has at least one endpoint in it. In this work, we study Weighted Vertex Cover…”
Get full text

On parameterized approximation algorithms for balanced clustering by Kong, Xiangyan, Zhang, Zhen, Feng, Qilong

“…Balanced clustering is a frequently encountered problem in applications requiring balanced class distributions, which generalizes the standard clustering…”
Get full text

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants by Bandyapadhyay, Sayan, Friggstad, Zachary, Mousavi, Ramin

“…k -center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean version…”
Get full text

Parameterized approximation algorithms for packing problems by Zehavi, Meirav

“… them. Therefore, it is natural to ask whether packing problems admit efficient parameterized approximation algorithms…”
Get full text

Parameterized Approximation Algorithms for Orienteering by Stärk, Luka

“…Diese Arbeit untersucht parametrisierte Approximationsalgorithmen für das asymmetric orienteering und k-stroll-Problem in Graphen, die die asymmetrische…”
Get full text

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem by Mashreghi, Ali, Zarei, Alireza

“… Later, Kapoor and Sarwat (Theory Comput. Syst. 41 (4), 779–794, 2007 ) introduced a parameterized approximation algorithm with performance guarantee of ( O ( p ⋅ ln n ln p ) , O ( ln n ln p…”
Get full text

Parameterized Approximation Schemes for Clustering with General Norm Objectives by Abbasi, Fateme, Banerjee, Sandip, Byrka, Jaroslaw, Chalermsook, Parinya, Gadekar, Ameet, Khodamoradi, Kamyar, Marx, Daniel, Sharma, Roohani, Spoerhase, Joachim

“…This paper considers the well-studied algorithmic regime of designing a (1+\epsilon)-approximation algorithm for a k-clustering problem that runs in time…”
Get full text

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems by Barış Can Esmer, Kulik, Ariel

“…In this paper we introduce Sampling with a Black Box, a generic technique for the design of parameterized approximation algorithms for vertex deletion problems (e.g…”
Get full text

Clustering with fair-center representation: parameterized approximation algorithms and heuristics by Thejaswi, Suhas, Gadekar, Ameet, Ordozgoiti, Bruno, Osadnik, Michal

“…We study a variant of classical clustering formulations in the context of algorithmic fairness, known as diversity-aware clustering. In this variant we are…”
Get full text

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems by Chitnis, Rajesh, Feldmann, Andreas Emil, Pasin Manurangsi

“…The Directed Steiner Network (DSN) problem takes as input a directed edge-weighted graph \(G=(V,E)\) and a set \(\mathcal{D}\subseteq V\times V\) of \(k\)…”
Get full text

Parameterized Approximation Algorithms for \(k\)-Center Clustering and Variants by Bandyapadhyay, Sayan, Friggstad, Zachary, Mousavi, Ramin

“…\(k\)-center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean…”
Get full text

Approximation Algorithms for Intersection Graphs by Kammer, Frank, Tholey, Torsten

“…We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of…”
Get full text

Parameterized Approximation Algorithms for some Location Problems in Graphs by Leitert, Arne, Dragan, Feodor F

“…We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) \(r\)-Domination problem and the (Connected) \(p\)-Center…”
Get full text

Parameterized Approximation Algorithms for Packing Problems by Zehavi, Meirav

“…In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these…”
Get full text

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem by Zhang, Zhen, Zhang, Jinchuan, Zhu, Lingzhi

“…Chromatic <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-median is a frequently encountered problem in the determination of the…”
Get full text

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments by van Bevern, René, Komusiewicz, Christian, Sorge, Manuel

“…We prove that any polynomial‐time α ( n ) ‐approximation algorithm for the n‐vertex metric asymmetric Traveling Salesperson Problem yields a polynomial‐time O…”
Get full text

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem by Zhang, Zhen, Gao, Zhuohang, Liu, Limei, Liu, Yao, Chen, Jie, Feng, Qilong

“…), is unlikely due to its W[2]-hardness. Thus, we focus on parameterized approximation algorithms for the problem…”
Get full text

The Parameterized Hardness of the k-Center Problem in Transportation Networks by Feldmann, Andreas Emil, Marx, Dániel

“… For each of these models, parameterized approximation algorithms have been shown to exist…”
Get full text

A parameterized approximation algorithm for the Multiple Allocation \(k\)-Hub Center by Benedito, Marcelo P L, Melo, Lucas P, Pedrosa, Lehilton L C

“…In the Multiple Allocation \(k\)-Hub Center (MA\(k\)HC), we are given a connected edge-weighted graph \(G\), sets of clients \(\mathcal{C}\) and hub locations…”
Get full text

A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments by René van Bevern, Komusiewicz, Christian, Sorge, Manuel

“…We prove that any polynomial-time \(\alpha(n)\)-approximation algorithm for the \(n\)-vertex metric asymmetric Traveling Salesperson Problem yields a…”
Get full text