Search Results - "polynomial time approximation algorithm"

Approximation Algorithms for Quadratic Programming by Fu, Minyue, Luo, Zhi-Quan, Ye, Yinyu

Get full text

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing by Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.

“… = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating…”
Get full text

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes by Wang, Jun-Qiang, Fan, Guo-Qiang, Zhang, Yingqian, Zhang, Cheng-Wu, Leung, Joseph Y.-T.

“… The objective is to minimize the makespan of the first agent subject to an upper bound on the makespan of the other…”
Get full text

Single-machine scheduling with periodic maintenance to minimize makespan by Ji, Min, He, Yong, Cheng, T.C.E.

“… We first prove that the worst-case ratio of the classical LPT algorithm is 2. Then we show that there is no polynomial time approximation algorithm with a worst-case ratio less than 2 unless P…”
Get full text

A Fast and Accurate Failure Frequency Approximation for k -Terminal Reliability Systems by Heidarzadeh, Anoosheh, Sprintson, Alex, Singh, Chanan

“… terminals) are connected through components, which are subject to random failure and repair processes. At any time, a system failure occurs if the surviving system fails to connect…”
Get full text

Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations by Yi Gai, Krishnamachari, B., Jain, R.

“… At each time multiple random variables can be selected, subject to an arbitrary constraint on weights associated with the selected variables…”
Get full text

Network Utility Maximization Under Maximum Delay Constraints and Throughput Requirements by Liu, Qingyu, Zeng, Haibo, Chen, Minghua

“…We consider a multi-path routing problem of maximizing the aggregate user utility over a multi-hop network, subject to link capacity constraints, maximum end-to-end delay constraints, and user throughput requirements…”
Get full text

Competitive algorithms for multistage online scheduling by Hopf, Michael, Thielen, Clemens, Wendt, Oliver

“…•We study online flow shop scheduling where jobs must be processed in several stages.•We show that a restricted version of the offline version of the problem…”
Get full text

Scheduling two parallel machines with machine-dependent availabilities by He, Jie, Li, Qingguo, Xu, Dehua

“… Due to the NP-hardness of the non-approximability of the problem, there does not exist any polynomial time approximation algorithm with a worst-case ratio less than 2 for the problem unless P=NP…”
Get full text

Graph Matching Via the Lens of Supermodularity by Konar, Aritra, Sidiropoulos, Nicholas D.

“… In this article, we approach the task of designing an efficient polynomial-time approximation algorithm for graph matching from a previously unconsidered perspective…”
Get full text

On the adaptivity gap of stochastic orienteering by Bansal, Nikhil, Nagarajan, Viswanath

“… The goal is to obtain a non-anticipatory policy (originating from a given root vertex) to run jobs at different vertices, that maximizes expected reward, subject to the total distance traveled plus processing times being at most…”
Get full text

The maximum flow problem with disjunctive constraints by Pferschy, Ulrich, Schauer, Joachim

“…We study the maximum flow problem subject to binary disjunctive constraints in a directed graph…”
Get full text

Digital Twin Model Selection for Feature Accuracy by Chen, Hong, Todd, Terence D., Zhao, Dongmei, Karakostas, George

“…). The objective is to maximize the minimum feature accuracy for the requested features by making appropriate model selections subject to the synchronization and ES execution constraints…”
Get full text

Scheduling deteriorating jobs with machine availability constraints to minimize the total completion time by Zhao, Chuan-Li, Hsu, Chou-Jung

“… For the parallel machine version, we first presented a pseudo-polynomial dynamic programming algorithm and then showed that there exists no polynomial time approximation algorithm with a constant…”
Get full text

QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm by Ying Xiao, Thulasiraman, Krishnaiyan, Xue, Guoliang, Yadav, Mamta

“…Consider a directed graph G(V, E), where V is the set of nodes and E is the set of links in G. Each link (u, v) is associated with a set of k+ 1 additive…”
Get full text

Energy-latency tradeoffs for data gathering in wireless sensor networks by Yang Yu, Krishnamachari, B., Prasanna, V.K.

“… For the off-line problem, we propose (a) a numerical algorithm for the optimal solution, and (h) a pseudo-polynomial time approximation algorithm based on dynamic…”
Get full text

Nature Reserve Selection Problem: A Tight Approximation Algorithm by Bordewich, M., Semple, C.

“… Recently, it has been shown in a paper by Moulton et al. that this problem is NP-hard. In this paper, we establish a tight polynomial-time approximation algorithm for the Nature Reserve Section Problem…”
Get full text

Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems by Bordewich, Magnus, Semple, Charles

“… Nevertheless, in both settings, this problem is NP-hard. However, it was recently shown that, for each setting, there is a polynomial-time -approximation algorithm for it and that this algorithm is tight…”
Get full text

Scheduling problem with flexible periodic maintenance activities on two parallel machines by Hua, Rongwei, Pan, Hong, Pan, Tianhai

“… We show that there is no polynomial time approximation algorithm with a worst-case ration less than 1 +t/T unless P = NP…”
Get full text

Digital Twin Model Selection for Feature Accuracy in Wireless Edge Networks by Chen, Hong, Todd, Terence D., Zhao, Dongmei, Karakostas, George

“…Digital twins (DTs) are virtual implementations of real physical systems (PSs) that interact with other objects on their behalf. Each PS periodically…”
Get full text