Výsledky vyhľadávania - "Approximation Algorithm"

On the parenthesisations of matrix chains: all are useful, few are essential

Autori: López Sánchez, Francisco Karlsson, Lars Bientinesi, Paolo

Zdroj: eSSENCE – An eScience Collaboration Journal of combinatorial optimization. 49(3)

Predmety: Approximation algorithm, Linear algebra compilers, Matrix chain, Matrix multiplication

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238200
https://doi.org/10.1007/s10878-025-01290-7

Upper and lower solution method for control of second-order Kolmogorov type systems

Autori: Alexandru Hofman

Zdroj: Journal of Numerical Analysis and Approximation Theory, Vol 54, Iss 1 (2025)

Predmety: control problem, QA1-939, Kolmogorov system, approximation algorithm, Mathematics

Prístupová URL adresa: https://doaj.org/article/45bb0581924440ecb585722625b4c3be

Sum-rate optimization methods and analysis for reconfigurable intelligent surface aided communication system

Autori: Jinfeng Li Xiaorong Zhu

Zdroj: Digital Communications and Networks, Vol 11, Iss 5, Pp 1421-1435 (2025)

Predmety: Reconfigurable intelligent surface, Timeliness, Accuracy, Alternating optimization algorithm, Polyblock outer approximation algorithm, Information technology, T58.5-58.64

Popis súboru: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S2352864825000707; https://doaj.org/toc/2352-8648

Prístupová URL adresa: https://doaj.org/article/2a657fc59dd64c68ae520efad14f3cf7

Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem

Autori: Zhang, Xiechen Angel, Eric Chu, Feng a ďalší

Prispievatelia: Zhang, Xiechen Angel, Eric Chu, Feng a ďalší

Zdroj: European Journal of Operational Research. 321:397-406

Predmety: Multi-criteria, Scheduling, Uncertainty, Approximation algorithm, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Identical parallel machines

Prístupová URL adresa: https://univ-evry.hal.science/hal-04742637v1
https://doi.org/10.1016/j.ejor.2024.09.032

Some complexity results on semipaired domination in graphs

Autori: Vikash Tripathi Kusum Arti Pandey

Zdroj: AKCE International Journal of Graphs and Combinatorics, Pp 1-7 (2024)

Predmety: Semipaired domination, QA1-939, AT-free graphs, planar graphs, approximation algorithm, Mathematics, NP-completeness

Prístupová URL adresa: https://doaj.org/article/ce88e7a6aea34dd6ae62d47706dbbe87

Desynchronized Wake-Up Algorithm for Energy Efficient EPON-Based 5G Backhaul

Autori: Dutta, Sourav Roy, Dibbendu Das, Goutam

Zdroj: Journal of Lightwave Technology. 43(10):4516-4529

Predmety: Optical network units, Energy conservation, Protocols, X reality, Standards, IEEE 802.3 Standard, EPON, Approximation algorithm, extended reality, energy-efficiency, 5G-backhaul, XR

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-364057

An adaptive greedy repair operator in a genetic algorithm for the minimum vertex cover problem

Autori: Seung-Hyun Moon Yourim Yoon

Zdroj: AIMS Mathematics, Vol 10, Iss 6, Pp 13365-13392 (2025)

Predmety: genetic algorithm, repair operator, greedy algorithm, approximation algorithm, vertex cover, Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://doaj.org/toc/2473-6988

Prístupová URL adresa: https://doaj.org/article/872a04b0a64b43378092c32795f2f781

Time-constrained Mobile Charging Scheduling for Heterogeneous Sensing in Wireless Rechargeable Sensor Networks

Autori: LI Deqiang, REN Xinyi, XU Jia

Zdroj: Jisuanji kexue, Vol 52, Iss 6, Pp 355-364 (2025)

Predmety: wireless rechargeable sensor network, mobile charging, discretization of charging time, submodular function, approximation algorithm, Computer software, QA76.75-76.765, Technology (General), T1-995

Popis súboru: electronic resource

Relation: https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2025-52-6-355.pdf; https://doaj.org/toc/1002-137X

Prístupová URL adresa: https://doaj.org/article/98c495f433b74d1595e8b780a0bbeccc

Dividing splittable goods evenly and with limited fragmentation

Autori: Damaschke, Peter, 1963

Zdroj: Algorithmica. 82(5):1298-1328

Predmety: Approximation algorithm, Parameterized algorithm, Fair division, Weighted graph, Linear-time algorithm

Popis súboru: electronic

Prístupová URL adresa: https://research.chalmers.se/publication/513743
https://research.chalmers.se/publication/513743/file/513743_Fulltext.pdf

Improved approximation algorithms for the k-path partition problem: Improved approximation algorithms for the \(k\)-path partition problem

Autori: Shiming Li Wei Yu Zhaohui Liu

Zdroj: Journal of Global Optimization. 90:983-1006

Predmety: Combinatorial optimization, local search, path partition problem, maximum traveling salesman problem, Approximation algorithms, approximation algorithm

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/7941543
https://doi.org/10.1007/s10898-024-01428-7

Selection and Ordering Policies for Hiring Pipelines via Linear Programming: Selection and ordering policies for hiring pipelines via linear programming

Autori: Boris Epstein Will Ma

Zdroj: Operations Research. 72:2000-2013

Predmety: FOS: Computer and information sciences, Labor markets, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, stochastic probing, Linear programming, hiring, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), adaptivity gap, 0101 mathematics, Theory of organizations, manpower planning in operations research, approximation algorithm

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2210.04059
https://zbmath.org/7960292
https://doi.org/10.1287/opre.2023.0061

An approximation algorithm for multiobjective mixed-integer convex optimization

Autori: Lammel, Ina Küfer, Karl-Heinz Süss, Philipp

Zdroj: Mathematical Methods of Operations Research. 100:321-350

Predmety: 03 medical and health sciences, 0302 clinical medicine, ddc:330, 0211 other engineering and technologies, 02 engineering and technology, Mixed-integer optimization, Approximation algorithm, Multiobjective optimization, Convex optimization

Prístupová URL adresa: https://hdl.handle.net/10419/314975

Mobility-Aware Utility Maximization in Digital Twin-Enabled Serverless Edge Computing

Autori: Jing Li Song Guo Weifa Liang a ďalší

Zdroj: IEEE Transactions on Computers. 73:1837-1851

Predmety: Computers, User mobility, Edge computing, Serverless computing, Utility maximization, Approximation algorithm, Digital twins, Approximation algorithms, Containers, Digital twin, Delay-sensitive service, Online algorithm, Heuristic algorithms, Mobile edge computing, User service satisfaction, Delays, Resource allocation and optimization

An improved approximation algorithm for covering vertices by $$4^+$$-paths: An improved approximation algorithm for covering vertices by \(4^+\)-paths

Autori: Mingyang Gong Zhi-Zhong Chen Guohui Lin a ďalší

Zdroj: Journal of Combinatorial Optimization. 49

Predmety: maximum matching, recursion, Mathematical programming, path cover, path-cycle cover, approximation algorithm

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/8032337
https://doi.org/10.1007/s10878-025-01279-2

Uav trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks: UAV trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks

Autori: Qing Zhao Zhen Li Jianqiang Li a ďalší

Zdroj: Journal of Combinatorial Optimization. 49

Predmety: data collection, deep reinforcement learning, Mathematical programming, trajectory optimization, approximation algorithm

Popis súboru: application/xml

Approximation algorithm for dynamic facility location problem

Autori: Li Zhang Qiaoliang Li

Zdroj: Journal of Combinatorial Optimization. 49

Predmety: Combinatorial optimization, dual-fitting, greedy augmentation, Mathematical programming, Integer programming, approximation algorithm, dynamic facility location

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/8032336
https://doi.org/10.1007/s10878-025-01282-7

Improved FPT Approximation for Sum of Radii Clustering with Mergeable Constraints

Autori: Bandyapadhyay, Sayan Chen, Tianzhi Sayan Bandyapadhyay and Tianzhi Chen

Prispievatelia: Bandyapadhyay, Sayan Chen, Tianzhi Sayan Bandyapadhyay and Tianzhi Chen

Predmety: mergeable constraints, sum-of-radii clustering, ddc:004, approximation algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.23

Approximability of Longest Run Subsequence and Complementary Minimization Problems

Autori: Asahiro, Yuichi Gong, Mingyang Jansson, Jesper a ďalší

Prispievatelia: Asahiro, Yuichi Gong, Mingyang Jansson, Jesper a ďalší

Predmety: minimum run subsequence deletion, Longest run subsequence, ddc:004, approximation algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2025.3

Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries

Autori: Terao, Tatsuya Tatsuya Terao

Prispievatelia: Terao, Tatsuya Tatsuya Terao

Predmety: streaming algorithm, ddc:004, Matroid intersection, approximation algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.50

Matching and Edge Cover in Temporal Graphs

Autori: Cioni, Lapo Dondi, Riccardo Marino, Andrea a ďalší

Prispievatelia: Cioni, Lapo Dondi, Riccardo Marino, Andrea a ďalší

Predmety: graphs, FOS: Computer and information sciences, Computer Science - Computational Complexity, temporal graphs, parameterized algorithm, matching, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC), edge cover, approximation algorithm

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2504.06762
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2025.8