Results 121 to 130 of about 47,064 (164)

Pooling Problems with Polynomial-Time Algorithms

Journal of Optimization Theory and Applications, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haugland, Dag, Hendrix, Eligius M.T.
openaire   +3 more sources

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees

Theory of Computing Systems, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cohen, Johanne, Fraigniaud, Pierre, Mitjana, Margarita   +2 more
openaire   +1 more source

Polynomial time algorithms for network information flow

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03, 2003
The famous max-flow min-cut theorem states that a source node s can send information through a network (V,E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to reencode the ...
Sanders, P., Egner, S., Tolhuizen, L.
openaire   +2 more sources

Polynomial-time approximation algorithms for the ising model

SIAM Journal on Computing, 1993
Summary: The paper presents a randomized algorithm which evaluates the partition function of an arbitrary ferromagnetic Ising system to any specified degree of accuracy. The running time of the algorithm increases only polynomially with the size of the system (i.e., the number of sites) and a parameter which controls the accuracy of the result. Further
Jerrum, Mark, Sinclair, Alistair
openaire   +2 more sources

General Polynomial Time Decomposition Algorithms

2005
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches the optimal solution. The number of iterations required to be within e of optimality grows linearly with 1/e and quadratically with the number m of variables.
Nikolas List, Hans Ulrich Simon
openaire   +1 more source

Markov chains and polynomial time algorithms

Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002
This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets. >
openaire   +1 more source

A Polynomial-Time Algorithm for Memory Space Reduction

International Journal of Parallel Programming, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Song, Yonghong, Wang, Cheng, Li, Zhiyuan
openaire   +2 more sources

A Polynomial Time Algorithm for Shaped Partition Problems

SIAM Journal on Optimization, 1999
Summary: We consider the class of shaped partition problems of partitioning \(n\) given vectors in \(d\)-dimensional criteria space into \(p\) parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary constraints on the number of elements in each part.
Hwang, Frank K., Onn, Shmuel, Rothblum, Uriel G.   +2 more
openaire   +1 more source

Polynomial time algorithms for Galois groups

2005
In this paper we present several polynomial time algorithms for Galois groups. We show: (i) There are polynomial time algorithms to determine: (a) If the Galois group of an irreducible polynomial over Q is a p-group. (b) the prime divisors of the order of a solvable Galois group (ii) Using the ...
openaire   +1 more source