Search Results - fully polynomial approximation algorithm

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions From Limited Samples

Authors: Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga

Resource Type: eBook.

Subjects: Characteristic functions, Approximation theory, Polynomials

Categories: SCIENCE / Physics / Mathematical & Computational

The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem: The fully polynomial approximation algorithm for the 0-1 knapsack problem

Authors: Yingjie Liu

Source: Theory of Computing Systems. 35:559-564

Subject Terms: Combinatorial optimization, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, fast approximation algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms

File Description: application/xml

Access URL: https://zbmath.org/1807939
https://doi.org/10.1007/s00224-002-1076-0
https://dblp.uni-trier.de/db/journals/mst/mst35.html#Liu02
https://rd.springer.com/article/10.1007%2Fs00224-002-1076-0
https://link.springer.com/article/10.1007%2Fs00224-002-1076-0

A fully polynomial approximation algorithm for the 0–1 knapsack problem: A fully polynomial approximation algorithm for the 0-1 knapsack problem

Authors: Osman Oguz Michael J. Magazine

Source: European Journal of Operational Research. 8:270-273

Subject Terms: Numerical mathematical programming methods, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Boolean programming, 0102 computer and information sciences, 02 engineering and technology, NP- complete problem, Dynamic programming, 01 natural sciences, polynomial epsilon-approximation algorithm, 0-1 knapsack problem

File Description: application/xml

Access URL: https://econpapers.repec.org/article/eeeejores/v_3a8_3ay_3a1981_3ai_3a3_3ap_3a270-273.htm
https://www.sciencedirect.com/science/article/abs/pii/0377221781901752
https://ideas.repec.org/a/eee/ejores/v8y1981i3p270-273.html

A Fully Polynomial Approximation Algorithm for Collaborative Relaying in Sensor Networks Under Finite Rate Constraints

Authors: Vasu Chakravarthy Rajgopal Kannan M. Rangaswamy et al.

Source: Lecture Notes in Computer Science ISBN: 9783540730897

Access URL: https://rd.springer.com/chapter/10.1007/978-3-540-73090-3_23
https://link.springer.com/content/pdf/10.1007%2F978-3-540-73090-3_23.pdf
https://link.springer.com/chapter/10.1007/978-3-540-73090-3_23
https://dblp.uni-trier.de/db/conf/dcoss/dcoss2007.html#KannanWCR07
https://dl.acm.org/doi/10.5555/1769087.1769110

Data Recovery Methods for Sensor Data in Water Distribution Systems Based on Spatiotemporal Redundancy.

Authors: Xu, Ang Tao, Lele Cai, Shuangshuang et al.

Source: Water (20734441); Nov2025, Vol. 17 Issue 21, p3082, 22p

Subject Terms: DATA recovery, WATER management, DIMENSIONAL reduction algorithms, POLYNOMIAL approximation, REAL-time computing, HIERARCHICAL clustering (Cluster analysis), PREDICTION models

Groundwater Storage Assessment in Abu Dhabi Emirate: Comparing Spatial Interpolation Models.

Authors: Maksoud, Tala Mohamed, Mohamed M.

Source: Water (20734441); Nov2025, Vol. 17 Issue 21, p3078, 18p

Subject Terms: GROUNDWATER, INTERPOLATION algorithms, WATER management, POLYNOMIAL approximation, AQUIFER storage recovery, GEOLOGICAL statistics, KRIGING

Geographic Terms: ABU Dhabi (United Arab Emirates)

New deterministic approximation algorithms for fully dynamic matching

Authors: Bhattacharya, S. Henzinger, M. Na Nongkai, Danupon

Source: STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING Proceedings of the Annual ACM Symposium on Theory of Computing. :398-411

Subject Terms: Data structures, Dynamic graph algorithms, Aluminum, Approximation algorithms, Approximation theory, Computation theory, Graph theory, Polynomial approximation, Bipartite graphs, Deterministic algorithms, Deterministic approximation, Dynamic algorithm, Dynamic matching, Maximum matchings, Positive integers, Algorithms

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-197222

A Note on Approximation Schemes for Multidimensional Knapsack Problems

Authors: Chern, Maw-Sheng

Source: Mathematics of Operations Research, 1984 May 01. 9(2), 244-247.

Access URL: https://www.jstor.org/stable/3689249

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

Authors: Ye, Yinyu

Source: Mathematics of Operations Research, 1993 May 01. 18(2), 334-345.

Access URL: https://www.jstor.org/stable/3690284

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

Authors: Van Hoesel, C. P. M. Wagelmans, A. P. M.

Source: Mathematics of Operations Research, 2001 May 01. 26(2), 339-357.

Access URL: https://www.jstor.org/stable/3690624

A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work

Authors: Kovalyov, M. Y. Potts, C. N. van Wassenhove, L. N.

Source: Mathematics of Operations Research, 1994 Feb 01. 19(1), 86-93.

Access URL: https://www.jstor.org/stable/3690378

Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

Authors: Jansen, Klaus Porkolab, Lorant

Source: Mathematics of Operations Research, 2001 May 01. 26(2), 324-338.

Access URL: https://www.jstor.org/stable/3690623

Tight Approximation Algorithms for Maximum Separable Assignment Problems

Authors: Fleischer, Lisa Goemans, Michel X. Mirrokni, Vahab S. et al.

Source: Mathematics of Operations Research, 2011 Aug 01. 36(3), 416-431.

Access URL: http://dx.doi.org/10.1287/moor.1110.0499

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

Authors: Kenyon, Claire Rémila, Eric

Source: Mathematics of Operations Research, 2000 Nov 01. 25(4), 645-656.

Access URL: https://www.jstor.org/stable/3690505

Unconstrained Convex Minimization in Relative Scale

Authors: Nesterov, Yurii

Source: Mathematics of Operations Research, 2009 Feb 01. 34(1), 180-193.

Access URL: https://www.jstor.org/stable/40538372

Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems

Authors: Adjiashvili, David Bosio, Sandro Li, Yuan et al.

Source: IEEE Transactions on Mobile Computing. 14(4):702-713

Subject Terms: Wireless communication, combinatorial algorithms, trees

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-117649
https://liu.diva-portal.org/smash/get/diva2:811557/FULLTEXT01.pdf

A NOTE ON APPROXIMATION SCHEMES FOR MULTIDIMENSIONAL KNAPSACK PROBLEMS.

Authors: Magazine, Michael J. Chern, Maw-Sheng

Source: Mathematics of Operations Research; May84, Vol. 9 Issue 2, p244-247, 4p

Subject Terms: POLYNOMIALS, APPROXIMATION theory, ALGORITHMS, KNAPSACK problems

Minimization of Half-Products

Authors: Badics, T. Boros, E.

Source: Mathematics of Operations Research, 1998 Aug 01. 23(3), 649-660.

Access URL: https://www.jstor.org/stable/3690564

HoRNS-CNN model: an energy-efficient fully homomorphic residue number system convolutional neural network model for privacy-preserving classification of dyslexia neural-biomarkers.

Authors: Usman, Opeyemi Lateef Muniyandi, Ravie Chandren Omar, Khairuddin et al.

Source: Brain Informatics; 4/30/2025, Vol. 12 Issue 1, p1-28, 28p

Subject Terms: DEEP learning, DATA encryption, ENERGY consumption, BIOMARKERS, MODULAR arithmetic, CLOUD computing

The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem.

Authors: Liu, Yingjie

Source: Theory of Computing Systems; 2002, Vol. 35 Issue 5, p559, 6p

Subject Terms: APPROXIMATION theory, KNAPSACK problems