Výsledky vyhledávání - "Parameterized approximation algorithms"

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

Autoři: Gadekar, Ameet Ordozgoiti, Bruno Osadnik a další

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2112.07030

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

Autoři: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Přispěvatelé: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.12654
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.39

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

Autoři: Sayan Bandyapadhyay Zachary Friggstad Ramin Mousavi

Zdroj: Algorithmica. 86:2557-2574

Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants

Autoři: Xianrun Chen Dachuan Xu Yicheng Xu a další

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

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

Autoři: Zhen Zhang Limei Liu Yao Liu a další

Zdroj: Lecture Notes in Computer Science ISBN: 9789819777518

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

Autoři: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Přispěvatelé: Can Esmer, Barış Kulik, Ariel Barış Can Esmer and Ariel Kulik

Témata: Parameterized Approximation Algorithms, Random Sampling

Popis souboru: 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

Dostupnost: 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

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

Autoři: Esmer, Barış Can Kulik, Ariel

Témata: Computer Science - Data Structures and Algorithms, text

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

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Autoři: Chitnis, Rajesh Feldmann, Andreas Emil Manurangsi, Pasin a další

Přispěvatelé: Chitnis, Rajesh Feldmann, Andreas Emil Manurangsi, Pasin a další

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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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 for K-center Clustering and Variants

Autoři: Bandyapadhyay, Sayan Friggstad, Zachary Mousavi, Ramin

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

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2112.10195

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)

Autoři: C. S., Karthik Chalermsook, Parinya Spoerhase, Joachim a další

Přispěvatelé: C. S., Karthik Chalermsook, Parinya Spoerhase, Joachim a další

Témata: Parameterized algorithms, ddc:004, approximation algorithms, Hardness of approximation

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.96

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)

Autoři: Karthik C. S. and Parinya Chalermsook and Joachim Spoerhase and Meirav Zehavi and Martin Herold C. S., Karthik Chalermsook, Parinya a další

Témata: 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)

On parameterized approximation algorithms for balanced clustering

Autoři: Xiangyan Kong Zhen Zhang Qilong Feng

Zdroj: Journal of Combinatorial Optimization. 45

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Parameterized Approximation Algorithms for TSP

Autoři: Zhou, Jianqi Li, Peihua Guo, Jiong a další

Přispěvatelé: Zhou, Jianqi Li, Peihua Guo, Jiong a další

Témata: the Traveling Salesman problem, metric graphs, fixed-parameter tractability, FPT-approximation algorithms, the triangle inequality, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.50

Parameterized Approximation Algorithms for Weighted Vertex Cover

Autoři: Soumen Mandal Pranabendu Misra Ashutosh Rai a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031556005

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs

Autoři: Zhao, Jingyang Sheng, Zimo Xiao, Mingyu

Témata: Data Structures and Algorithms

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

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

Parameterized Approximation Algorithms for Some Location Problems in Graphs

Autoři: Leitert, Arne Dragan, Feodor F.

Zdroj: Lecture Notes in Computer Science ISBN: 9783319711461

Témata: 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

Přístupová URL adresa: 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

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

Autoři: Bandyapadhyay, Sayan Friggstad, Zachary Mousavi, Ramin

Témata: Computer Science - Data Structures and Algorithms, text

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

Clustering with fair-center representation: parameterized approximation algorithms and heuristics

Autoři: Thejaswi, Suhas Gadekar, Ameet Ordozgoiti, Bruno a další

Témata: Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, G.2.1, F.2.0, F.1.3, text

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

Parameterized approximation algorithms for packing problems

Autoři: Meirav Zehavi

Zdroj: Theoretical Computer Science. 648:40-55

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/1505.00709
https://arxiv.org/abs/1505.00709
https://doi.org/10.1016/j.tcs.2016.08.004
https://arxiv.org/pdf/1505.00709v1
https://dblp.uni-trier.de/db/journals/corr/corr1505.html#Zehavi15c
https://www.sciencedirect.com/science/article/pii/S0304397516303917

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem

Autoři: Alireza Zarei Ali Mashreghi

Zdroj: Theory of Computing Systems. 58:287-303

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/article/10.1007%2Fs00224-015-9615-7
https://doi.org/10.1007/s00224-015-9615-7
https://dblp.uni-trier.de/db/journals/mst/mst58.html#MashreghiZ16