Suchergebnisse - "Polynomial time approximation scheme"

A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand

Autoren: Aaron Willcock Nathan Fisher Thidapat (Tam) Chantem

Quelle: Proceedings of the 32nd International Conference on Real-Time Networks and Systems. :175-186

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/10919/124521
https://doi.org/10.1145/3696355.3696367

An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines

Autoren: Epstein, Leah Levin, Asaf Leah Epstein and Asaf Levin

Weitere Verfasser: Epstein, Leah Levin, Asaf Leah Epstein and Asaf Levin

Schlagwörter: Approximation schemes, Min-sum objective, ddc:004, Scheduling algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.25

An efficient polynomial-time approximation scheme for parallel multi-stage open shops.

Autoren: Dong, Jianming Jin, Ruyan Lin, Guohui et al.

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 377, p390-401. 12p.

Schlagwörter: *SCHEDULING, *APPROXIMATION algorithms, *PRODUCTION scheduling, *LINEAR programming

Facility Location Under Nonlinear Customer Demand: A Fully Polynomial-Time Approximation Scheme

Autoren: Ba Luat Le Thuy Anh Ta Ngoc Anh Vu Thi et al.

Quelle: Lecture Notes in Computer Science ISBN: 9789819663880

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

Autoren: In-Jae Jeong

Quelle: Engineering Optimization. 57:1323-1342

A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs

Autoren: Jian Ding Hang Du Shuyang Gong

Quelle: Random Structures & Algorithms. 65:220-257

Schlagwörter: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops

Autoren: Mingyang Gong Guohui Lin Eiji Miyano et al.

Quelle: Annals of Operations Research. 335:185-204

A Fully Polynomial Time Approximation Scheme for Constrained MDPs Under Local Transitions

Autoren: Majid Khonji

Quelle: 2023 62nd IEEE Conference on Decision and Control (CDC). :1782-1789

Parallel Polynomial-Time Approximation Scheme (PTAS) for Finding Compact Structural Motifs

Autoren: Bernard Brocka Sharlene Yap Jhoirene Clemente

Quelle: Proceedings of the 2023 10th International Conference on Biomedical and Bioinformatics Engineering. :73-79

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

Autoren: Grange, Aristide Kacem, Imed Martin, Sébastien et al.

Weitere Verfasser: Grange, Aristide Kacem, Imed Martin, Sébastien et al.

Quelle: RAIRO - Operations Research. 57:1-16

Schlagwörter: dynamic programming, 0103 physical sciences, 0211 other engineering and technologies, scheduling, [MATH] Mathematics [math], 02 engineering and technology, FPTAS, 01 natural sciences, Approximation algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-03936905v1/document
https://doi.org/10.1051/ro/2022022
https://hal.science/hal-03936905v1

A POLYNOMIAL TIME APPROXIMATION SCHEME FOR COMPUTING THE SUPREMUM OF GAUSSIAN PROCESSES

Autoren: Meka, Raghu

Quelle: The Annals of Applied Probability, 2015 Apr 01. 25(2), 465-476.

Zugangs-URL: http://www.jstor.org/stable/24519924

Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment

Autoren: Mirmahdi Rahgoshay Mohammad R. Salavatipour Mirmahdi Rahgoshay and Mohammad R. Salavatipour

Weitere Verfasser: Mirmahdi Rahgoshay Mohammad R. Salavatipour Mirmahdi Rahgoshay and Mohammad R. Salavatipour

Quelle: Algorithmica. 84:2462-2479

Schlagwörter: Resource Management, 0211 other engineering and technologies, Asymptotic Approximation Scheme, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences, Firefighter Problem, Fire Containment, Approximation Algorithm

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.33

A polynomial time approximation scheme for the scheduling problem in the AGV system

Autoren: Xinrui Li Chaoyang Wang Hao Hu et al.

Quelle: 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). :11695-11702

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand

Autoren: Willcock, Aaron Fisher, Nathan Chantem, Thidapat (Tam)

Index Begriffe: Article - Refereed

Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem

Autoren: Doerr, Benjamin Rajabi, Amirhossein Witt, Carsten et al.

Weitere Verfasser: Doerr, Benjamin Rajabi, Amirhossein Witt, Carsten et al.

Quelle: Proceedings of the Genetic and Evolutionary Computation Conference. :1381-1389

Schlagwörter: FOS: Computer and information sciences, Approximation scheme, Computer Science - Neural and Evolutionary Computing, 0102 computer and information sciences, 02 engineering and technology, Simulated annealing Approximation scheme Minimum spanning trees Runtime analysis Theory, 01 natural sciences, Simulated annealing, Minimum spanning trees, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Theory, [INFO]Computer Science [cs], Data Structures and Algorithms (cs.DS), Runtime analysis, Neural and Evolutionary Computing (cs.NE)

Zugangs-URL: http://arxiv.org/abs/2204.02097

A fully polynomial time approximation scheme for the probability maximizing shortest path problem

Autoren: Seulgi Joung Jisun Lee Kyungsik Lee

Quelle: European Journal of Operational Research. 300:35-45

Schlagwörter: 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0377221721008638

A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

Autoren: Weitian Tong Yao Xu Huili Zhang

Quelle: Theoretical Computer Science. 922:438-446

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2201.04196

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Autoren: Halman, Nir Klabjan, Diego Mostagir, Mohamed et al.

Quelle: Mathematics of Operations Research, 2009 Aug 01. 34(3), 674-685.

Zugangs-URL: https://www.jstor.org/stable/40538438

A fully polynomial time approximation scheme for the Replenishment Storage problem.

Autoren: Hochbaum, Dorit S Rao, Xu

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/96w1c7x6
https://escholarship.org/content/qt96w1c7x6/qt96w1c7x6.pdf

A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs

Autoren: Andrew Bloch-Hansen Daniel R. Page Roberto Solis-Oba

Quelle: Lecture Notes in Computer Science ISBN: 9783031343469