Suchergebnisse - "Fully polynomial-time approximation algorithms"

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks von Zhang, Shurong, Chen, Lin, Yang, Weihua

“… In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the …”
Volltext

Improved Results on Geometric Hitting Set Problems von Mustafa, Nabil H., Ray, Saurabh

“… Therefore, unless P = NP, it is not possible to get Fully Polynomial Time Approximation Algorithms (FPTAS) for such problems …”
Volltext

A PTAS for the cardinality constrained covering with unit balls von Ghasemi, Taha, Razzazi, Mohammadreza

“… In this paper, we address the cardinality constrained covering with unit balls problem: given a positive integer L and a set of n points in Rd, partition them …”
Volltext

A generalized approximation framework for fractional network flow and packing problems von Holzhauser, Michael, Krumke, Sven O.

“… We generalize the fractional packing framework of Garg and Koenemann (SIAM J Comput 37(2):630–652, 2007 ) to the case of linear fractional packing problems …”
Volltext

System Level Power and Thermal Management on Embedded Processors von Zhang, Sushu

“… Semiconductor scaling technology has led to a sharp growth in transistor counts. This has resulted in an exponential increase on both power dissipation and …”
Volltext

A Generalized Approximation Framework for Fractional Network Flow and Packing Problems von Holzhauser, Michael, Krumke, Sven O

“… We generalize the fractional packing framework of Garg and Koenemann to the case of linear fractional packing problems over polyhedral cones. More precisely, …”
Volltext

The effect of interference on the capacity of multihop wireless networks von Kodialam, M., Nandagopal, T.

“… The necessary conditions for achievability in the three models as linear constraints, and the structure of these constraints to develop efficient fully polynomial time approximation algorithms …”
Volltext

Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness von Nguyen, Trung Thanh, Elbassioni, Khaled, Luong, Nguyen Cong, Niyato, Dusit, Kim, Dong In

“… In this paper, we consider a distributed joint sensing and communication (DJSC) system in which each radar sensor as a JSC node is equipped with a sensing …”
Volltext

Optimization Algorithms for Joint Power and Sub-Channel Allocation for NOMA-Based Maritime Communications von Li, Huanyu, Li, Hui, Zhou, Youling

“… This paper investigates resource optimization schemes in a marine communication scenario based on non-orthogonal multiple access (NOMA). According to the …”
Volltext

Solving knapsack problems with S-curve return functions von Ağralı, Semra, Geunes, Joseph

“… efficient solution methods for special cases of the problem. We also discuss a fully-polynomial-time approximation algorithm for the integer variable version of the problem …”
Volltext

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches von Jeong, In-Jae

“… For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service …”
Volltext

Hop-Limit Path Mapping Algorithm for Virtual Network Embedding von Zhang, Min, Tang, Xijie

“… to minimize the maximum link load factor. Through the use of the primal–dual method, a fully polynomial time approximation algorithm is proposed to solve this model …”
Volltext

Collaborative caching for multicell-coordinated systems von Khreishah, Abdallah, Chakareski, Jacob

“… Cellular networks have become a major Internet gateway over which online video is increasingly accessed. Data caching in cellular networks brings the accessed …”
Volltext

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval von Kacem, Imed

“… (Fully Polynomial Time Approximation Algorithm) by exploiting the well-known approach of Ibarra and Kim (J. ACM 22:463–468, 1975 …”
Volltext

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates von Kacem, Imed, Kellerer, Hans

“… This paper is the first attempt to successfully design efficient approximation algorithms for the single-machine weighted flow-time minimization problem when …”
Volltext

Lot-sizing with non-stationary cumulative capacities von Sargut, F. Zeynep, Romeijn, H. Edwin

“… We study a new class of capacitated economic lot-sizing problems. We show that the problem is NP-hard in general and derive a fully polynomial-time approximation algorithm under mild conditions on the cost functions …”
Volltext

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval von Alhadi, Gais, Kacem, Imed, Laroche, Pierre, Osman, Izzeldin M.

“… We present a dynamic programming algorithm and we show that the problem has an FPTAS (Fully Polynomial Time Approximation Algorithm …”
Volltext

On Deterministically Approximating Total Variation Distance von Feng, Weiming, Liu, Liqiang, Liu, Tianren

“… ) and a randomized algorithm for general product distributions (Feng, Guo, Jerrum and Wang 2023). We give a deterministic fully polynomial-time approximation algorithm (FPTAS …”
Volltext

A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width von Angel, Eric, Morais, Sébastien, Regnault, Damien

“… Our result is a bi-criteria fully polynomial time approximation algorithm based on a dynamic programming algorithm …”
Volltext

MSRT: Multi-Source Request and Transmission in Content-Centric Networks von Qing Li, Bin Gan, Guangwu Hu, Yong Jiang, Qingmin Liao, Mingwei Xu

“… We prove that the problem is NP complete and thus design a fully polynomial-time approximation algorithm to solve this problem …”
Volltext