Výsledky vyhľadávania - "Efficient approximation algorithms"

Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks

Autori: Hao Zhong Weisheng Li Qi Zhang a ďalší

Zdroj: IEEE Transactions on Computational Social Systems. :1-10

Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee

Autori: Chen Feng Xingguang Chen Qintian Guo a ďalší

Zdroj: Proceedings of the ACM on Management of Data. 2:1-26

Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time

Autori: Chi-Yeh Chen

Zdroj: IEEE Transactions on Services Computing. 17:2349-2364

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2307.04107

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint

Autori: Rui, Xiaobin Wang, Zhixiao Peng, Chen a ďalší

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2509.26579

Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks

Autori: Chi-Yeh Chen

Zdroj: IEEE Transactions on Cloud Computing. 12:116-129

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: http://arxiv.org/abs/2306.02293

Efficient approximation algorithms for scheduling moldable tasks

Autori: Xiaohu Wu Patrick Loiseau Loiseau, Patrick a ďalší

Prispievatelia: Xiaohu Wu Patrick Loiseau Loiseau, Patrick a ďalší

Zdroj: European Journal of Operational Research. 310:71-83

Predmety: Scheduling, moldable tasks, approximation algorithms, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Popis súboru: application/pdf

Efficient Approximation Algorithms for Spanning Centrality

Autori: Shiqi Zhang Renchi Yang Jing Tang a ďalší

Zdroj: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. :3386-3395

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2305.16086

Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem

Autori: Ke Zhang Xiaoqing Wang Gong Cheng

Zdroj: Proceedings of the ACM Web Conference 2023. :199-209

An Exemplars-Based Approach for Explainable Clustering: Complexity and Efficient Approximation Algorithms

Autori: Davidson, Ian Livanos, Micheal Gourru, Antoine a ďalší

Prispievatelia: Davidson, Ian Livanos, Micheal Gourru, Antoine a ďalší

Predmety: [INFO] Computer Science [cs]

Prístupová URL adresa: https://hal.science/hal-04428883v1

Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs

Autori: Fenghe Xia Longkun Guo Xiaoyan Zhang

Zdroj: Lecture Notes in Computer Science ISBN: 9789819777976

An Exemplars-Based Approach for Explainable Clustering: Complexity and Efficient Approximation Algorithms

Autori: Ian Davidson Michael Livanos Antoine Gourru a ďalší

Zdroj: Proceedings of the 2024 SIAM International Conference on Data Mining (SDM) ISBN: 9781611978032

Efficient Approximation Algorithms for Spanning Centrality

Autori: Zhang, Shiqi Yang, Renchi Tang, Jing a ďalší

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

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

Efficient approximation algorithms for adaptive influence maximization

Autori: Keke Huang Jing Tang Kai Han a ďalší

Zdroj: The VLDB Journal. 29:1385-1406

Predmety: Social and Information Networks (cs.SI), FOS: Computer and information sciences, Computer Science - Social and Information Networks

Prístupová URL adresa: http://arxiv.org/abs/2004.06469

Efficient Approximation Algorithms for Adaptive Target Profit Maximization

Autori: Xiaokui Xiao Keke Huang Andrew Lim a ďalší

Zdroj: 2020 IEEE 36th International Conference on Data Engineering (ICDE). :649-660

Predmety: Social and Information Networks (cs.SI), FOS: Computer and information sciences, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Social and Information Networks, 02 engineering and technology

Prístupová URL adresa: http://arxiv.org/pdf/1910.13073
http://arxiv.org/abs/1910.13073
https://dblp.uni-trier.de/db/conf/icde/icde2020.html#Huang0XSL20
https://www.computer.org/csdl/proceedings-article/icde/2020/09101853/1kaMEGpR49q
https://ieeexplore.ieee.org/document/9101853/
http://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-13073
https://arxiv.org/pdf/1910.13073.pdf
https://arxiv.org/abs/1910.13073

Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks

Autori: Chen, Chi-Yeh

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

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

Efficient Approximation Algorithms for Scheduling Coflows with Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time

Autori: Chen, Chi-Yeh

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

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

Efficient Approximation Algorithms for Minimum Dominating Sets in Social Networks

Autori: Traian Marius Truta Matthew Beckerich Alina Campan

Zdroj: Research Anthology on Artificial Intelligence Applications in Security ISBN: 9781799877059

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 16. Peace & justice

Prístupová URL adresa: https://ideas.repec.org/a/igg/jssmet/v9y2018i2p1-32.html
https://doi.org/10.4018/IJSSMET.2018040101
https://dl.acm.org/doi/10.4018/IJSSMET.2018040101
https://www.igi-global.com/article/efficient-approximation-algorithms-for-minimum-dominating-sets-in-social-networks/201471
https://dblp.uni-trier.de/db/journals/ijssmet/ijssmet9.html#TrutaCB18

Efficient approximation algorithms for maximum coverage with group budget constraints

Autori: Longkun Guo Min Li Dachuan Xu

Zdroj: Theoretical Computer Science. 788:53-65

Predmety: 0102 computer and information sciences, 01 natural sciences

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0304397519301215
https://dblp.uni-trier.de/db/journals/tcs/tcs788.html#GuoLX19
https://doi.org/10.1016/j.tcs.2019.02.015

Efficient Approximation Algorithms for Adaptive Seed Minimization

Autori: Xiaokui Xiao Keke Huang Xueyan Tang a ďalší

Zdroj: Proceedings of the 2019 International Conference on Management of Data. :1096-1113

Predmety: Social and Information Networks (cs.SI), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Social and Information Networks, Data Structures and Algorithms (cs.DS), 02 engineering and technology

Prístupová URL adresa: http://arxiv.org/pdf/1907.09668
http://arxiv.org/abs/1907.09668
https://ui.adsabs.harvard.edu/abs/2019arXiv190709668T/abstract
https://arxiv.org/abs/1907.09668
https://arxiv.org/pdf/1907.09668v1
https://dl.acm.org/doi/pdf/10.1145/3299869.3319881
https://dblp.uni-trier.de/db/conf/sigmod/sigmod2019.html#TangHXLTSL19
https://dl.acm.org/citation.cfm?id=3319881

Efficient Approximation Algorithms for Server Allocation to Minimize Total Capacity under Server Failure

Autori: Inoue, Masahiro Oki, Eiji

Zdroj: IEEE Transactions on Computers ; page 1-14 ; ISSN 0018-9340 1557-9956 2326-3814

Dostupnosť: https://doi.org/10.1109/tc.2025.3627912
http://xplorestaging.ieee.org/ielx8/12/4358213/11224627.pdf?arnumber=11224627