Showing 1 - 20 results of 119 for search '"approximation algorithm"', query time: 0.11s Refine Results
  1. 1
  2. 2

    A Survey of Approximation Algorithms for the Power Cover Problem by Jiaming Zhang, Zhikang Zhang, Weidong Li

    Published 2025-08-01
    “…It also provides a comprehensive overview of the power cover problem and its variants under both specified and unspecified sensor settings, summarizes existing results and approximation algorithms, and outlines potential directions for future research.…”
    Get full text
    Article
  3. 3

    An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective by Ľuboš Buzna, Michal Koháni, Jaroslav Janáček

    Published 2014-01-01
    “…We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. …”
    Get full text
    Article
  4. 4
  5. 5
  6. 6
  7. 7

    Improved FFT-based alpha-stable density approximation algorithm by BAI Yun, YU Li, ZHU Guang-xi, LI Li

    Published 2007-01-01
    “…Approximation of density of α-stable process is an elementary works in modeling network flow using α-stable process.Combining the mathematical properties of characteristic function of α-stable process with the traditional approximating algorithm,an improved FFT-based algorithm was proposed.The improved algorithm has 2 noticeable features: automatically choosing the sampling space and sampling interval,importing frequency expansion.Experiments show that it can decrease calculation complexity and effectively control computation error.…”
    Get full text
    Article
  8. 8

    A Survey of Approximation Algorithms for the Universal Facility Location Problem by Hanyin Xiao, Jiaming Zhang, Zhikang Zhang, Weidong Li

    Published 2025-03-01
    “…A comprehensive survey is conducted of existing approximation algorithms and theoretical results. The relevant results of their important variants are also discussed. …”
    Get full text
    Article
  9. 9
  10. 10
  11. 11
  12. 12

    Efficiency comparison of exact and approximate algorithms for solving set covering problem by Igor S. Konovalov, Sergey S. Ostapenko, Valery G. Kobak

    Published 2017-10-01
    “…Techniques of the set covering problem solution by exact and approximate algorithms are considered. The genetic algorithm is used as the approximate method, and the branch and bounds algorithm - as the exact method. …”
    Get full text
    Article
  13. 13
  14. 14

    A Combinatorial Approximation Algorithm for the Vector Scheduling with Submodular Penalties on Parallel Machines by Bihui Cheng, Wencheng Wang

    Published 2023-01-01
    “…Our main work is to design a 2−1/mminr,d-approximation algorithm to solve this problem. Here, r denotes the maximum ratio of the maximum load to the minimum load on the d-dimensional vectors among all jobs.…”
    Get full text
    Article
  15. 15

    Approximation Algorithms for Maximum Link Scheduling under SINR-Based Interference Model by Zi-Ao Zhou, Chang-Geng Li

    Published 2015-07-01
    “…To date, several approximation algorithms have been proposed to solve MLS under the SINR-based interference model. …”
    Get full text
    Article
  16. 16

    APPLICATION OF THE SOFTWARE TOOLS EXPERIMENTAL DESIGN FOR THE GENETIC APPROXIMATION ALGORITHM PARAMETER OPTIMIZATION by Vitaly V. VOLKOV

    Published 2010-08-01
    “…Experimental optimization of convergence rate of the genetic approximation algorithm accomplished with the application of the specialized scientific design of experiments software tools is described.…”
    Get full text
    Article
  17. 17
  18. 18

    Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations by Xuefei Shi, Dehua Xu

    Published 2014-01-01
    “…We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. …”
    Get full text
    Article
  19. 19

    Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks by Hu Shen, Shaohe Lv, Xuan Dong, Junquan Deng, Xiaodong Wang, Xingming Zhou

    Published 2013-01-01
    “…Afterwards, we prove that the MU-MIMO MLLS problem is NP-hard and introduce two approximation algorithms to find the near-optimal feasible schedule. …”
    Get full text
    Article
  20. 20

    FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM by Ksenia Rizhenko, Katherine Neznakhina, Michael Khachay

    Published 2023-07-01
    Subjects: “…prize-collecting traveling salesman problem, triangle inequality, approximation algorithm, fixed approximation ratio.…”
    Get full text
    Article