Search Results - "polynomial time approximation algorithms"

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

“…Scheduling sensor activity to prolong the network lifetime while guaranteeing coverage and connectivity is a fundamental and critical issue in handling…”
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

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs by 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…”
Get full text

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

“…We consider a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A weighted sequence determines the probability for…”
Get full text

Polynomial-time approximation algorithms for anchor-free TDoA localization by 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…”
Get full text

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

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

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials by 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…”
Get full text

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

“…We consider the coloring problem for hereditary graph classes, i.e. classes of simple unlabeled graphs closed under deletion of vertices. For the family of the…”
Get full text

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

“…The paper presents a randomised algorithm which evaluates the partition function of an arbitrary ferromagnetic Ising system to any specified degree of…”
Get full text

A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme by Saller, Sophia, Koehler, Jana, Karrenbauer, Andreas

“…The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science…”
Get full text

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks by 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…”
Get full text

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

“…This paper considers the problem of approximating the failure frequency of large-scale composite <inline-formula> <tex-math…”
Get full text

On polynomial-time approximation algorithms for the variable length scheduling problem by Czumaj, Artur, Ga̧sieniec, Leszek, Gaur, Daya Ram, Krishnamurti, Ramesh, Rytter, Wojciech, Zito, Michele

“…This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1–2), (2001) 569–582) where they…”
Get full text

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

“…In this paper 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…”
Get full text

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs by 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…”
Get full text

Near optimal multiple alignment within a band in polynomial time by Ma, Bin, Wang, Lusheng, Li, Ming

“…Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band…”
Get full text

SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES by YUAN, JINJIANG, SHI, LEI, OU, JINWEN

“… The problem is strongly NP-hard in general. In this study, we show that the case with a fixed number of forbidden intervals can be solved by a pseudo-polynomial time algorithm, while no polynomial time approximation algorithm with a fixed…”
Get full text

Algorithms for a Variant of the Full Steiner Tree Problem by Wang, Haiyan, Huang, Binchao, Li, Jianping

“… In this paper, we propose two asymptotic polynomial-time approximation algorithms for this problem…”
Get full text

Packing k-edge trees in graphs of restricted vertex degrees by Kelmans, A.K.

“…Let ${\cal G}^{s}_{r}$ denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and τk (G) the maximum number…”
Get full text

Minimum Congestion Redundant Assignments to Tolerate Random Faults by FOTAKIS, D. A, SPIRAKIS, P. G

Get full text