Suchergebnisse - Polynomial-time approximation algorithm*

(1 + ϵ)2-and Polynomial-Time Approximation Algorithms for Network Lifetime Maximization With Relay Hop Bounded Connected Target Coverage in WSNs von Le Nguyen, Phi, Ji, Yusheng, Pham, Minh Khiem, Le, Hieu, Nguyen, Thanh Hung

“… As a result, the existing scheduling algorithms can provide only connectivity with uncontrollable latency to the sinks and can't be applied to delay-sensitive applications …”
Volltext

Erratum to “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks” von Bouznif, M., Giroudeau, R.

“… Approximation Results If the network is a ring, there are two approximation results for Rayward-Smith's [2 …”
Volltext

Polynomial time approximation algorithms for proportionate open-shop scheduling von Naderi, B., Zandieh, M., Yazdani, M.

“… This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open …”
Volltext

A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem von Pan, Pengxiang, Zhu, Hongtao

“… The objective is to minimize the weight of the maximum weight cycle. We propose a strongly polynomial time 16-approximation algorithm for the MM-CCC problem …”
Volltext

A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem von Moothedath, Shana, Chaporkar, Prasanna, Belur, Madhu N.

“… Using this condition, we propose a polynomial time reduction of the problem to a known NP-hard problem …”
Volltext

Polynomial-Time Approximation Algorithms for the Ising Model von Jerrum, Mark, Sinclair, Alistair

“… ) and a parameter which controls the accuracy of the result. Further approximation algorithms are presented for the mean energy and the mean magnetic moment of ferromagnetic Ising systems …”
Volltext

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials von Patel, Viresh, Regts, Guus

“… We show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs …”
Volltext

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing von 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 …”
Volltext

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs von Dyer, Martin, Heinrich, Marc, Jerrum, Mark, Müller, Haiko

“… We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph …”
Volltext

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications von Oda, Masaki, Kawabata, Akio, Oki, Eiji

“… This letter proposes two polynomial-time approximation algorithms for allocating servers to design a consistency-aware multi-server network for delay-sensitive applications …”
Volltext

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions von Feng, Weiming, Guo, Heng, Jerrum, Mark, Wang, Jiaheng

“… We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions …”
Volltext

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

“… We develop the first fixed-ratio approximation algorithm for the well-known Prize-Collecting Asymmetric Traveling Salesman Problem …”
Volltext

Two-agent scheduling to minimize the total cost von Nong, Q.Q., Cheng, T.C.E., Ng, C.T.

“… ► We devise a polynomial time approximation scheme for this case. Two agents, each having his own set of jobs, compete to perform their own jobs on a common processing resource …”
Volltext

Polynomial-time approximation algorithms for weighted LCS problem von Cygan, M., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.

“… We also improve the (1/|Σ|)-approximation algorithm given by Amir et al. (where Σ is the alphabet): we show a polynomial-time approximation scheme (PTAS) for the LCWS2 problem using O(n5) space. We also give a simpler (1/2)-approximation algorithm for the same problem using only O(n2) space …”
Volltext

Polynomial-time approximation algorithms for anchor-free TDoA localization von Wendeberg, Johannes, Schindelhauer, Christian

“… We present the first polynomial-time approximation algorithms for the minimum problem in the plane, in which the number of receivers is four, respectively the number of signals is three …”
Volltext

Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center von Kel’manov, A. V., Motkova, A. V.

“… A strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters is considered. The solution criterion is the minimum of …”
Volltext

Polynomial-time approximation algorithms for the coloring problem in some cases von Malyshev, D. S.

“… For the problem and the open three cases, we present approximation polynomial-time algorithms with performance guarantees …”
Volltext

A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements von Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I., Pyatkin, A. V., Shamardin, Yu. V., Shenmaier, V. V.

“… We analyze the mathematical aspects of the data analysis problem consisting in the search (selection) for a subset of similar elements in a group of objects …”
Volltext

An approximation polynomial-time algorithm for a sequence bi-clustering problem von Kel’manov, A. V., Khamidullin, S. A.

“… We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum …”
Volltext

Nonconvex piecewise linear knapsack problems von Kameshwaran, S., Narahari, Y.

“… This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the …”
Volltext