Suchergebnisse - Parameterized approximation algorithms

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

“… )-bi-criteria approximation algorithm for (k,W)-Vertex Cover either produces a vertex cover S such that |S|≤ak and w …”
Volltext

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

“… ]-hard if parameterized by k , implying that the existences of FPT( k )-time exact algorithms for these problems are unlikely …”
Volltext

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

“… Without this restriction, a classic algorithm by Agarwal and Procopiuc [Algorithmica 2002] yields an O ( n log k ) + ( 1 / ϵ ) O ( 2 d k 1 - 1 / d log k …”
Volltext

Parameterized approximation algorithms for packing problems von Zehavi, Meirav

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

p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms von Einarson, Carl, Gutin, Gregory, Jansen, Bart M.P., Majumdar, Diptapriyo, Wahlström, Magnus

“… Finally, we describe a 2(p+1)-approximation algorithm for the p-Edge-Connected VC. The proofs for the new VC problems require more sophisticated arguments than for Connected VC …”
Volltext

Faster approximation schemes and parameterized algorithms on (odd-) H -minor-free graphs von Tazari, Siamak

“… ]. We use these algorithms to derive faster 2-approximations; furthermore, we present the first PTASes and subexponential FPT-algorithms for independent set and vertex cover on these graph classes using a novel dynamic programming technique …”
Volltext

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem von 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 …”
Volltext

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments von 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 ( α ( C …”
Volltext

Parameterized Approximation Algorithms for Orienteering von Stärk, Luka

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

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree von Li, Wenjun, Cao, Yixin, Chen, Jianer, Wang, Jianxin

“… )-time parameterized algorithm. Using depth-2 local search, Knauer and Spoerhase (2015) [9] developed a (5/3)-approximation algorithm for the optimization version …”
Volltext

Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees von Chen, Jianer, Fan, Jia-Hao, Sze, Sing-Hoi

“… We study parameterized algorithms and approximation algorithms for the maximum agreement forest problem, which, for two given leaf-labeled trees, is to find a maximum forest that is a subgraph of both trees …”
Volltext

Parameterized and Approximation Algorithms for the Load Coloring Problem von Barbero, F., Gutin, G., Jones, M., Sheng, B.

“… Let c ,  k be two positive integers. Given a graph G = ( V , E ) , the c - Load Coloring problem asks whether there is a c -coloring φ : V → [ c ] such that …”
Volltext

Parameterized Approximation Schemes for Clustering with General Norm Objectives von 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 f …”
Volltext

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms von Feldmann, Andreas Emil, Karthik C. S., Karthik C., Lee, Euiwoong, Manurangsi, Pasin

“… Parameterization and approximation are two popular ways of coping with NP-hard problems …”
Volltext

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem von 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 …”
Volltext

Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees von Akutsu, Tatsuya, Fukagawa, Daiji, Halldórsson, Magnús M., Takasu, Atsuhiro, Tanaka, Keisuke

“… : giving exact algorithms, either for special cases or in terms of some parameters; and approximation algorithms and hardness of approximation …”
Volltext

Parameterized and approximation algorithms for finding two disjoint matchings von Chen, Zhi-Zhong, Fan, Ying, Wang, Lusheng

“… We further present a combinatorial approximation algorithm for the NP-hard problem of finding two disjoint matchings in a given edge-weighted graph G so that their total weight is maximized …”
Volltext

Approximation Algorithms for Intersection Graphs von 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 …”
Volltext

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems von 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 …”
Volltext

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

“… Motivated by these results we identify natural parameters of the problem, and present fixed-parameter approximation algorithms with approximation …”
Volltext