Search Results - Advanced a-fully polynomial time approximation scheme*

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches.

Authors: Jeong, In-Jae

Source: Engineering Optimization; May2025, Vol. 57 Issue 5, p1323-1342, 20p

Subject Terms: POLYNOMIAL approximation, POLYNOMIAL time algorithms, HEURISTIC algorithms, CUSTOMER satisfaction, TRANSPORTATION schedules

A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment

Authors: Shiyan Hu Charles J. Alpert Zhuo Li

Source: IEEE Transactions on Circuits and Systems II: Express Briefs. 56:580-584

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://dblp.uni-trier.de/db/journals/tcas/tcasII56.html#HuLA09
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000004982748
http://ieeexplore.ieee.org/document/4982748/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004982748
http://dblp.uni-trier.de/db/journals/tcas/tcasII56.html#HuLA09

A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane

Authors: Yasser M. Abd El-Latif Salwa M. Ali Hanaa A.E. Essa et al.

Subject Terms: Perfect matching, approximation algorithm, Monte-Carlo technique, a randomized fully polynomial-time approximation scheme, and randomized algorithm

Relation: http://dx.doi.org/10.14569/IJACSA.2012.031122

Availability: https://doi.org/10.14569/IJACSA.2012.031122

An Approach to Web Services Selection for Multiple Users

Authors: Wenlong Zhu Beibei Yin Siqian Gong et al.

Source: IEEE Access, Vol 5, Pp 15093-15104 (2017)

Subject Terms: Advanced a-fully polynomial time approximation scheme, web service selection, 0202 electrical engineering, electronic engineering, information engineering, artificial bee colony algorithm, multiple users, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, Pareto optimal set, TK1-9971

Access URL: https://doaj.org/article/5d6cd9241b7d465f9250b7c739104bfb
http://ieeexplore.ieee.org/document/7964679/
https://ieeexplore.ieee.org/document/7964679/
https://doi.org/10.1109/ACCESS.2017.2722228
https://dblp.uni-trier.de/db/journals/access/access5.html#ZhuYGC17

Envy-Free Division of Multilayered Cakes.

Authors: Igarashi, Ayumi Meunier, Frédéric

Source: Mathematics of Operations Research; Aug2025, Vol. 50 Issue 3, p2261-2286, 26p

Subject Terms: ALGORITHMS, APPROXIMATION algorithms, CONSTRAINT satisfaction, FIXED point theory, RESOURCE allocation, PASTRY

Coordinated order scheduling and outsourcing on dedicated parallel machines.

Authors: Ou, Jinwen Li, Weidong Zhong, Xueling

Source: European Journal of Operational Research. Mar2026, Vol. 329 Issue 3, p798-807. 10p.

Subject Terms: *SCHEDULING, *CONTRACTING out, *MATHEMATICAL optimization, *COST, *PARALLEL programming, APPROXIMATION algorithms

Rescheduling for new orders on a single machine with rejection.

Authors: Fang, Kan Luo, Wenchang Pinedo, Michael L. et al.

Source: Journal of the Operational Research Society; Feb2024, Vol. 75 Issue 2, p346-360, 15p

Subject Terms: POLYNOMIAL time algorithms, POLYNOMIAL approximation, APPROXIMATION algorithms, UNEMPLOYMENT, NP-hard problems, WORKING hours

Approximate Counting of Linear Extensions in Practice.

Authors: Talvitie, Topi Koivisto, Mikko

Source: Journal of Artificial Intelligence Research; 2024, Vol. 81, p643-681, 39p

Subject Terms: MACHINE learning, ALGORITHMS, EXPERIMENTS, MACHINE theory, POLYNOMIALS

A Robust Service Mapping Scheme for Multi-Tenant Clouds.

Authors: Wang, Jingzhou Zhao, Gongming Xu, Hongli et al.

Source: IEEE/ACM Transactions on Networking; Jun2022, Vol. 30 Issue 3, p1146-1161, 16p

Subject Terms: APPROXIMATION algorithms, KNAPSACK problems, VIRTUAL private networks, POLYNOMIAL time algorithms, POLYNOMIAL approximation, TRAFFIC assignment

Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.

Authors: Halman, Nir Li, Chung-Lun Simchi-Levi, David

Source: Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783540853626); 2008, p91-103, 13p

Bin stretching with migration on two hierarchical machines.

Authors: Akaria, Islam Epstein, Leah

Source: Mathematical Methods of Operations Research; Aug2023, Vol. 98 Issue 1, p111-153, 43p

Subject Terms: POLYNOMIAL approximation, POLYNOMIAL time algorithms, MACHINERY, PRODUCTION scheduling

A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion.

Authors: Shiyan Hu Zhuo Li Alpert, Charles J.

Source: DAC: Annual ACM/IEEE Design Automation Conference; Jul2009, p424-429, 6p, 4 Charts

Subject Terms: INTEGER programming, DYNAMIC programming, SYSTEMS engineering, SYSTEMS development, COMPUTER architecture, BOTTLENECKS (Manufacturing), INTEGRATED circuit design

An Advanced QoS-Based Web Service Selection Approach

Authors: ZHU, Wen-long YIN, Bei-bei GONG, Si-qian et al.

Source: DEStech Transactions on Computer Science and Engineering; 2nd International Conference on Computer Science and Technology (CST 2017) ; 2475-8841

Subject Terms: Web service selection, Pareto optimal solution, Advanceda-fully polynomial time approximation scheme (A2-FPTAS), Unequal local error bound

Availability: https://www.dpi-journals.com/index.php/dtcse/article/view/12600
https://doi.org/10.12783/dtcse/cst2017/12600

Empowering the configuration-IP: new PTAS results for scheduling with setup times.

Authors: Jansen, Klaus Klein, Kim-Manuel Maack, Marten et al.

Source: Mathematical Programming; Sep2022, Vol. 195 Issue 1/2, p367-401, 35p

Subject Terms: SETUP time, SCHEDULING, POLYNOMIAL approximation, POLYNOMIAL time algorithms, INTEGER programming, COMPUTER scheduling, PRODUCTION scheduling

Scheduling jobs with a V-shaped time-dependent processing time.

Authors: Sedding, Helmut A.

Source: Journal of Scheduling; 2020, Vol. 23 Issue 6, p751-768, 18p

Subject Terms: POLYNOMIAL approximation, POLYNOMIAL time algorithms, CONVEX functions, ABSOLUTE value, PRODUCTION planning

Fully Homomorphic Enabled Secure Task Offloading and Scheduling System for Transport Applications.

Authors: lakhan, Abdullah Mohammed, Mazin Abed Garcia-Zapirain, Begonya et al.

Source: IEEE Transactions on Vehicular Technology; Nov2022, Vol. 71 Issue 11, p12140-12153, 14p

Subject Terms: RESOURCE allocation, KNAPSACK problems, SCHEDULING, CLOUD computing, DATA encryption, COMPUTER architecture, TASK analysis, BACKPACKS

Generalized Dynamic Flow on Lossy Network.

Authors: Gautam, Santosh Pyakurel, Urmila Dhamala, Tanka Nath

Source: Journal of the Institute of Engineering; 2019, Vol. 15 Issue 2, p171-182, 12p

Subject Terms: POLYNOMIAL approximation, POLYNOMIAL time algorithms, TAILS

A bandwidth allocation scheme for compositional real-time systems with periodic resources.

Authors: Fisher, Nathan Dewan, Farhana

Source: Real-Time Systems; May2012, Vol. 48 Issue 3, p223-263, 41p

Subject Terms: BANDWIDTHS, REAL-time clocks (Computers), APPROXIMATION algorithms, POLYNOMIALS, COMPLEXITY (Philosophy), DATA transmission systems

Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work.

Authors: Sterna, Malgorzata Czerniachowska, Kateryna

Source: Journal of Optimization Theory & Applications; Sep2017, Vol. 174 Issue 3, p927-944, 18p

Subject Terms: POLYNOMIALS, PARALLEL computers, COMPUTER scheduling, PROBLEM solving, MATHEMATICAL proofs, COMPUTATIONAL complexity

A ROBUST AFPTAS FOR ONLINE BIN PACKING WITH POLYNOMIAL MIGRATION.

Authors: JANSEN, KLAUS KLEIN, KIM-MANUEL

Source: SIAM Journal on Discrete Mathematics; 2019, Vol. 33 Issue 4, p2062-2091, 30p

Subject Terms: BIN packing problem, POLYNOMIAL approximation, POLYNOMIALS, NP-hard problems, POLYNOMIAL time algorithms, PACKING problem (Mathematics)