Search Results - parameterized approximation algorithms

Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics

Authors: Gadekar, Ameet Ordozgoiti, Bruno Osadnik et al.

Source: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. :1749-1759

Subject Terms: ta113, FOS: Computer and information sciences, G.2.1, 0102 computer and information sciences, 02 engineering and technology, algorithmic fairness, 01 natural sciences, fixed parameter tractability, parameterized approximation algorithms, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), F.1.3, F.2.0, clustering

Access URL: http://arxiv.org/abs/2112.07030

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems

Authors: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Contributors: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Subject Terms: FOS: Computer and information sciences, Random Sampling, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Parameterized Approximation Algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/2407.12654
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.39

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Authors: Chitnis, Rajesh Feldmann, Andreas Emil Manurangsi, Pasin et al.

Contributors: Chitnis, Rajesh Feldmann, Andreas Emil Manurangsi, Pasin et al.

Source: ACM Transactions on Algorithms
26th Annual European Symposium on Algorithms (ESA 2018)

Subject Terms: FOS: Computer and information sciences, 000 Computer science, knowledge, general works, Computational Complexity (cs.CC), 16. Peace & justice, QA76, Bidirected Graphs, Computer Science - Computational Complexity, Planar Graphs, Computer Science, Directed Steiner Network, Parameterized Approximations, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Strongly Connected Steiner Subgraph

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2018/9483/pdf/LIPIcs-ESA-2018-20.pdf
http://arxiv.org/abs/1707.06499
http://wrap.warwick.ac.uk/110380/1/WRAP-parameterized-approximation-algorithms-bidirected-steiner-network-problems-Chitnis-2018.pdf
https://drops.dagstuhl.de/opus/volltexte/2018/9483/pdf/LIPIcs-ESA-2018-20.pdf/
https://dblp.uni-trier.de/db/conf/esa/esa2018.html#ChitnisFM18
https://drops.dagstuhl.de/opus/volltexte/2018/9483/
https://arxiv.org/abs/1707.06499
https://arxiv.org/pdf/1707.06499.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1707.html#ChitnisFM17
https://dl.acm.org/doi/abs/10.1145/3447584
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.20

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants

Authors: Sayan Bandyapadhyay Zachary Friggstad Ramin Mousavi

Source: Algorithmica. 86:2557-2574

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)

Authors: C. S., Karthik Chalermsook, Parinya Spoerhase, Joachim et al.

Contributors: C. S., Karthik Chalermsook, Parinya Spoerhase, Joachim et al.

Subject Terms: Parameterized algorithms, ddc:004, approximation algorithms, Hardness of approximation

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.96

Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants

Authors: Xianrun Chen Dachuan Xu Yicheng Xu et al.

Source: Proceedings of the AAAI Conference on Artificial Intelligence. 38:20666-20673

Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem

Authors: Zhen Zhang Limei Liu Yao Liu et al.

Source: Lecture Notes in Computer Science ISBN: 9789819777518

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems

Authors: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Contributors: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Subject Terms: Parameterized Approximation Algorithms, Random Sampling

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.39

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2025.39
https://nbn-resolving.org/urn:nbn:de:0030-drops-234165
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.39

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)

Authors: Karthik C. S. and Parinya Chalermsook and Joachim Spoerhase and Meirav Zehavi and Martin Herold C. S., Karthik Chalermsook, Parinya et al.

Index Terms: approximation algorithms, Hardness of approximation, Parameterized algorithms, Article, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.96
Is Part Of Dagstuhl Reports, Volume 13, Issue 7 (2024)

Parameterized Approximation Algorithms for K-center Clustering and Variants

Authors: Bandyapadhyay, Sayan Friggstad, Zachary Mousavi, Ramin

Source: Proceedings of the AAAI Conference on Artificial Intelligence. 36:3895-3903

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/abs/2112.10195

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems

Authors: Esmer, Barış Can Kulik, Ariel

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2407.12654

Parameterized Approximation Algorithms for TSP

Authors: Zhou, Jianqi Li, Peihua Guo, Jiong et al.

Contributors: Zhou, Jianqi Li, Peihua Guo, Jiong et al.

Subject Terms: the Traveling Salesman problem, metric graphs, fixed-parameter tractability, FPT-approximation algorithms, the triangle inequality, ddc:004

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.50

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs

Authors: Zhao, Jingyang Sheng, Zimo Xiao, Mingyu

Subject Terms: Data Structures and Algorithms

Relation: http://arxiv.org/abs/2503.03642

Availability: http://arxiv.org/abs/2503.03642

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem

Authors: Zhen Zhang Jinchuan Zhang Lingzhi Zhu

Source: IEEE Access, Vol 9, Pp 31678-31683 (2021)

Subject Terms: Approximation, fixed-parameter tractability, clustering, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

File Description: electronic resource

Relation: https://ieeexplore.ieee.org/document/9358230/; https://doaj.org/toc/2169-3536

Access URL: https://doaj.org/article/0b7c1ea8ad8c4050af12c22d64c7029b

Parameterized Approximation Algorithms for Some Location Problems in Graphs

Authors: Leitert, Arne Dragan, Feodor F.

Source: Lecture Notes in Computer Science ISBN: 9783319711461

Subject Terms: FOS: Computer and information sciences, Computer Sciences, Theory and Algorithms, Connected p-center, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Tree-breadth, 01 natural sciences, Layering partition, Computer Science - Data Structures and Algorithms, Connected r-domination, Data Structures and Algorithms (cs.DS), Graph algorithms, Tree-length

Access URL: http://arxiv.org/pdf/1706.07475
http://arxiv.org/abs/1706.07475
https://dblp.uni-trier.de/db/conf/cocoa/cocoa2017-2.html#LeitertD17
https://digitalcommons.cwu.edu/cotsfac/330/
https://rd.springer.com/chapter/10.1007/978-3-319-71147-8_24
https://dblp.uni-trier.de/db/journals/corr/corr1706.html#LeitertD17
https://www.sciencedirect.com/science/article/pii/S0304397518304651
http://dblp.uni-trier.de/db/journals/corr/corr1706.html#LeitertD17
https://arxiv.org/abs/1706.07475

On parameterized approximation algorithms for balanced clustering

Authors: Xiangyan Kong Zhen Zhang Qilong Feng

Source: Journal of Combinatorial Optimization. 45

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem.

Authors: Zhang, Zhen Gao, Zhuohang Liu, Limei et al.

Source: Theoretical Computer Science. Oct2025, Vol. 1052, pN.PAG-N.PAG. 1p.

Subject Terms: *APPROXIMATION algorithms, *KNAPSACK problems, *METRIC spaces, *BUDGET, *PROBLEM solving

Parameterized Approximation Algorithms for Weighted Vertex Cover

Authors: Soumen Mandal Pranabendu Misra Ashutosh Rai et al.

Source: Lecture Notes in Computer Science ISBN: 9783031556005

Parameterized Approximation Algorithms for $k$-Center Clustering and Variants

Authors: Bandyapadhyay, Sayan Friggstad, Zachary Mousavi, Ramin

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2112.10195

Parameterized Expectations Algorithm and the Moving Bounds

Authors: Maliar, Lilia Maliar, Serguei

Source: Journal of Business & Economic Statistics, 2003 Jan 01. 21(1), 88-92.

Access URL: https://www.jstor.org/stable/1392354