Search Results - Efficient approximation algorithms

Refine Results
  1. 1

    Multicell Coordinated Beamforming With Rate Outage Constraint-Part II: Efficient Approximation Algorithms by Li, Wei-Chiang, Chang, Tsung-Hui, Chi, Chong-Yung

    ISSN: 1053-587X, 1941-0476
    Published: IEEE 01.06.2015
    Published in IEEE transactions on signal processing (01.06.2015)
    “… Therefore, the focus of this paper is on suboptimal but computationally efficient algorithms…”
    Get full text
    Journal Article
  2. 2

    Efficient approximation algorithm for the Schrödinger–Possion system by He, Xuefei, Wang, Kun

    ISSN: 0749-159X, 1098-2426
    Published: Hoboken, USA John Wiley & Sons, Inc 01.01.2021
    “…In this article, we study an efficient approximation algorithm for the Schrödinger–Possion system arising in the resonant tunneling diode…”
    Get full text
    Journal Article
  3. 3

    An Efficient Approximation Algorithm for Service Function Chaining Placement in Edge-Cloud Computing Industrial Internet of Things by Asgarian, Mina, Jamshidi, Kamal, Bohlooli, Ali

    ISSN: 2327-4662, 2327-4662
    Published: Piscataway IEEE 01.04.2024
    Published in IEEE internet of things journal (01.04.2024)
    “…Edge-Cloud Computing Industrial Internet of Things (ECIIoT) is composed of edge and cloud nodes with Industrial Internet of Things (IIoT) devices to get the…”
    Get full text
    Journal Article
  4. 4

    Efficient approximation algorithms for scheduling moldable tasks by Wu, Xiaohu, Loiseau, Patrick

    ISSN: 0377-2217, 1872-6860
    Published: Elsevier B.V 01.10.2023
    Published in European journal of operational research (01.10.2023)
    “…•An efficient algorithm for makespan minimization is proposed, achieving an approximation ratio close…”
    Get full text
    Journal Article
  5. 5

    Efficient approximation algorithms for adaptive influence maximization by Huang, Keke, Tang, Jing, Han, Kai, Xiao, Xiaokui, Chen, Wei, Sun, Aixin, Tang, Xueyan, Lim, Andrew

    ISSN: 1066-8888, 0949-877X
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2020
    Published in The VLDB journal (01.11.2020)
    “… The majority of the existing algorithms for the IM problem are developed only under the non-adaptive setting, i.e…”
    Get full text
    Journal Article
  6. 6

    Efficient Approximation Algorithms for Server Allocation to Minimize Total Capacity under Server Failure by Inoue, Masahiro, Oki, Eiji

    ISSN: 0018-9340, 1557-9956
    Published: IEEE 2025
    Published in IEEE transactions on computers (2025)
    “…Real-time applications, such as ticket booking systems, video streaming systems, social networking services, and online games, are prevalent nowadays. Low…”
    Get full text
    Journal Article
  7. 7

    Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds by Guo, Longkun, Shen, Hong

    ISSN: 1045-9219, 1558-2183
    Published: New York IEEE 01.12.2017
    “… This paper presents a factor C/C-k approximation algorithm…”
    Get full text
    Journal Article
  8. 8

    An efficient ensemble algorithm for numerical approximation of stochastic Stokes–Darcy equations by Jiang, Nan, Qiu, Changxin

    ISSN: 0045-7825, 1879-2138
    Published: Amsterdam Elsevier B.V 01.01.2019
    “…We propose and analyze an efficient ensemble algorithm for fast computation of multiple realizations of the stochastic Stokes…”
    Get full text
    Journal Article
  9. 9

    Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time by Chen, Chi-Yeh

    ISSN: 1939-1374, 2372-0204
    Published: IEEE 01.09.2024
    Published in IEEE transactions on services computing (01.09.2024)
    “… When considering workload sizes and weights that are dependent on the network topology in the input instances, the proposed algorithm for the flow-level scheduling problem…”
    Get full text
    Journal Article
  10. 10

    Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks by Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong

    ISSN: 2329-924X, 2373-7476
    Published: Piscataway IEEE 01.10.2025
    “… The purpose of this article is to propose new approximation algorithms for the minimum PIDS problem and its variants such as the minimum connected PIDS and the minimum PIDS of multiplex networks…”
    Get full text
    Journal Article
  11. 11

    Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization by Swamy, Peruru Subrahmanya, Ganti, Radha Krishna, Jagannathan, Krishna

    ISSN: 1063-6692, 1558-2566
    Published: New York IEEE 01.08.2017
    Published in IEEE/ACM transactions on networking (01.08.2017)
    “… We propose two local optimization-based approximation algorithms to efficiently estimate certain attempt rate parameters of CSMA called fugacities…”
    Get full text
    Journal Article
  12. 12

    Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks by Chen, Chi-Yeh

    ISSN: 2168-7161, 2372-0018
    Published: Piscataway IEEE 01.01.2024
    Published in IEEE transactions on cloud computing (01.01.2024)
    “…This article addresses the scheduling problem of coflows in identical parallel networks, a well-known <inline-formula><tex-math notation="LaTeX">\mathcal…”
    Get full text
    Journal Article
  13. 13

    Efficient approximation algorithms for offline and online unit disk multiple coverage by Gao, Xuening, Guo, Longkun, Liao, Kewen

    ISSN: 0045-7906, 1879-0755
    Published: Elsevier Ltd 01.12.2022
    Published in Computers & electrical engineering (01.12.2022)
    “…Multiple coverage with unit disks is a problem widely seen in monitoring applications of wireless sensor networks. In this problem, let T=t1,t2,…,tn be a set…”
    Get full text
    Journal Article
  14. 14
  15. 15

    Efficient Approximation Algorithms for Adaptive Target Profit Maximization by Huang, Keke, Tang, Jing, Xiao, Xiaokui, Sun, Aixin, Lim, Andrew

    ISSN: 2375-026X
    Published: IEEE 01.04.2020
    Published in Data engineering (01.04.2020)
    “… Existing algorithms for PM mostly consider the nonadaptive setting, where all seed nodes are selected in one batch without any knowledge on how they may influence other users…”
    Get full text
    Conference Proceeding
  16. 16

    An efficient approximation algorithm for the nonlinear reaction: diffusion equations in an electro catalytic thin film models using Hosoya polynomials by Bhuvaneswari, M., Vinoba, V., Hariharan, G.

    ISSN: 0259-9791, 1572-8897
    Published: Cham Springer International Publishing 01.07.2025
    Published in Journal of mathematical chemistry (01.07.2025)
    “… A new Hosoya polynomial approximation method (HPAM) is applied for solving the reaction…”
    Get full text
    Journal Article
  17. 17

    On the Convergence of an Efficient Algorithm for Kullback-Leibler Approximation of Spectral Densities by Ferrante, Augusto, Ramponi, Federico, Ticozzi, Francesco

    ISSN: 0018-9286, 1558-2523
    Published: New York, NY IEEE 01.03.2011
    Published in IEEE transactions on automatic control (01.03.2011)
    “… After developing the variational analysis, we discuss the properties of an efficient algorithm for the solution of the corresponding dual problem, based on the iteration of a nonlinear map…”
    Get full text
    Journal Article
  18. 18

    Efficient approximation algorithms for the routing open shop problem by Chernykh, Ilya, Kononov, Alexander, Sevastyanov, Sergey

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: New York Elsevier Ltd 01.03.2013
    Published in Computers & operations research (01.03.2013)
    “… We present new polynomial-time approximation algorithms with worst-case performance guarantees…”
    Get full text
    Journal Article
  19. 19

    An efficient approximation algorithm for variance global sensitivity by Bayesian updating by Chen, Pu, Lu, Zhenzhou

    ISSN: 1569-1713, 1573-8841
    Published: Dordrecht Springer Netherlands 01.12.2024
    “… In the proposed algorithm, the input realizations are firstly treated as observations to construct a likelihood function…”
    Get full text
    Journal Article
  20. 20

    Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs by Obata, Yuji, Nishizeki, Takao

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 23.11.2015
    Published in Theoretical computer science (23.11.2015)
    “… In the paper, we present four efficient approximation algorithms for the problem, which have theoretical performance guarantees for the computation time, the span of a found b-coloring and the approximation ratio. We also obtain several upper bounds on the minimum span, expressed in terms of the maximum b-degrees, one of which is an extension of Brooks' theorem on an ordinary coloring…”
    Get full text
    Journal Article