Search Results - approximation algorithm

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Authors: Nilsson, Bengt J. Packer, Eli

Source: Algorithmica. 86(9):2845-2884

Subject Terms: Art gallery problems, Visibility, Watchman routes, Approximation algorithms

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-69948
https://doi.org/10.1007/s00453-024-01245-0

Stable Approximation Algorithms for Dominating Set and Independent Set: Stable approximation algorithms for dominating set and independent set

Authors: Mark de Berg Arpan Sadhukhan Frits Spieksma et al.

Contributors: Mark de Berg Arpan Sadhukhan Frits Spieksma et al.

Source: SIAM Journal on Discrete Mathematics. 39:921-945

Subject Terms: FOS: Computer and information sciences, dynamic algorithms, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, General topics of discrete mathematics in relation to computer science, dominating set, stability, Approximation algorithms, bounded recourse, independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, approximation algorithms, Dynamic algorithms, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2412.13358
https://zbmath.org/8037180
https://doi.org/10.1137/24m1644079
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27

A FASTER DETERMINISTIC APPROXIMATION ALGORITHM FOR TTP-2

Authors: Kanaya, Yuga Takazawa, Kenjiro

Source: Journal of the Operations Research Society of Japan. 68:99-123

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

Access URL: http://arxiv.org/abs/2310.02592

A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set

Authors: Jiao Zhou Yingli Ran Panos M. Pardalos et al.

Source: INFORMS Journal on Computing. 37:1106-1120

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 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, F.2.2, 01 natural sciences, 68W25, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2301.09247

An improved approximation algorithm for Hypergraph Max p-Section

Authors: Guangfeng Li Jian Sun Jiaquan Gao et al.

Source: Discrete Applied Mathematics. 377:102-112

Approximation algorithm for prize-collecting weighted set cover with fairness constraints

Authors: Mingchao Zhou Zhao Zhang

Source: Discrete Applied Mathematics. 373:301-315

An Inner Approximation Algorithm for Dynamic Optimization With Strict Satisfaction of Path Constraints

Authors: Jun Fu Lizhong Jiang

Source: IEEE Transactions on Automatic Control. 70:7039-7046

Exact and approximation algorithms for routing a convoy through a graph

Authors: Martijn van Ee Tim Oosterwijk René Sitters et al.

Contributors: Martijn van Ee Tim Oosterwijk René Sitters et al.

Source: Mathematical Programming. 213:985-1008

Subject Terms: 90C27, 90C39, Shortest path problem, Traveling salesperson problem, 0211 other engineering and technologies, 68Q25, traveling salesperson problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68W25, Approximation algorithms, Convoy routing, ddc:004, approximation algorithms, convoy routing, shortest path problem

File Description: application/pdf

Access URL: https://hdl.handle.net/1871.1/cae572ff-f830-4025-82ed-460f67cd18e9
https://research.vu.nl/en/publications/cae572ff-f830-4025-82ed-460f67cd18e9
https://doi.org/10.1007/s10107-024-02159-z
https://research.vu.nl/en/publications/a7c48309-ef48-48a2-a4e3-0f60f6229aee
https://hdl.handle.net/1871.1/a7c48309-ef48-48a2-a4e3-0f60f6229aee
https://doi.org/10.4230/LIPIcs.MFCS.2023.86
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.86

A Simpler and Parallelizable \(\boldsymbol{O(\sqrt{\log n})}\) -Approximation Algorithm for Sparsest Cut

Authors: Vladimir Kolmogorov

Source: ACM Transactions on Algorithms. 21:1-22

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

Tight Approximation Algorithms for 2D Guillotine Strip Packing

Authors: Arindam Khan Aditya Lonkar Arnab Maiti et al.

Source: ACM Transactions on Algorithms. 21:1-30

Subject Terms: ddc

File Description: application/pdf

Access URL: https://mediatum.ub.tum.de/1833029

Approximation algorithm for the minimum capacitated sweep coverage problem.

Authors: Shou, Qingye Liang, Wei Zhang, Zhao

Source: Discrete Mathematics, Algorithms & Applications. Oct2025, p1. 8p.

Subject Terms: *APPROXIMATION algorithms, *VEHICLE routing problem, *ALGORITHMS, *WIRELESS sensor nodes, *MATHEMATICAL optimization

A New Rational Approximation Algorithm via the Empirical Interpolation Method

Authors: Aidi Li Yuwen Li

Source: SIAM Journal on Scientific Computing. 47:A2559-A2582

Subject Terms: Mathematics - Numerical Analysis

Access URL: http://arxiv.org/abs/2406.19339

A multilevel stochastic approximation algorithm for value-at-risk and expected shortfall estimation

Authors: Crépey, Stéphane Frikha, Noufel Louzi, Azar

Source: Finance and Stochastics. 29:1015-1074

Subject Terms: FOS: Economics and business, Quantitative Finance - Computational Finance, Risk Management (q-fin.RM), Probability (math.PR), FOS: Mathematics, Computational Finance (q-fin.CP), Mathematics - Probability, Quantitative Finance - Risk Management

Access URL: http://arxiv.org/abs/2304.01207

Iterative polynomial approximation algorithms for inverse graph filters

Authors: Cheng, Cheng Sun, Qiyu Zheng, Cong

Source: 2025 International Conference on Sampling Theory and Applications (SampTA). :1-5

Subject Terms: Signal Processing (eess.SP), FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing

Access URL: http://arxiv.org/abs/2504.14341

A Scalable Binary CUR Low-Rank Approximation Algorithm

Authors: Su, Bowen

Source: 2025 IEEE 11th International Conference on Big Data Computing Service and Machine Learning Applications (BigDataService). :239-243

Subject Terms: Performance (cs.PF), FOS: Computer and information sciences, Computer Science - Performance, FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA)

Access URL: http://arxiv.org/abs/2502.11017

An Improved Approximation Algorithm for the Minimum 4-Star Partition Problem

Authors: Qilu Bao Wei Yu Zhaohui Liu et al.

Source: International Journal of Foundations of Computer Science. :1-12

Approximation Algorithms for Dynamic Inventory Management on Networks

Authors: Levi DeValve Jabari Myles

Source: Management Science. 71:5893-5909

Optimization of Vlsi Physical Design Bisectional Placement with Quantum Approximation Algorithm

Authors: null Pushpalatha Pondreti

Source: Tuijin Jishu/Journal of Propulsion Technology. 46:1073-1084

A Lasserre SDP Rounding Approximation Algorithm for Max Directed 3-Section

Authors: Guangfeng Li Jian Sun Donglei Du et al.

Source: Tsinghua Science and Technology. 30:1885-1896