AbstractA polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and time-complexity estimations of this algorithm are given. The space complexity of this algorithm may be decreased for problems with an algorithmic representation of some input data. Examples of such problems and algorithms to them ar
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
In this paper we consider the probable performance of three polynomial time approximation algorithm...
AbstractGiven integers a, b, c, d, we present a polynomial algorithm for the query “is ab ≥ cd?”. Th...
AbstractA polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and...
Given a graph with n vertices, k terminals and positive integer weights not larger than c, we comput...
AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with v...
We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree prob...
An efficient evaluation method is described for polynomials in finite fields. Its complexity is show...
This chapter is devoted to compact extended formulations of tree problems. First, we give a compact ...
AbstractWe present and illustrate by a sequence of examples an algorithm paradigm for solving NP- ha...
Abstract. We propose a polynomial-time-delay polynomial-space algorithm to enumerate all efficient e...
In this paper we present techniques that result in O(n) time algorithms for computing many propertie...
We show that for any k there is a polynomial time algorithm to evaluate the weighted graph polyno...
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this arti...
International audienceThe construction of a spanning tree is a fundamental task in distributed syste...
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
In this paper we consider the probable performance of three polynomial time approximation algorithm...
AbstractGiven integers a, b, c, d, we present a polynomial algorithm for the query “is ab ≥ cd?”. Th...
AbstractA polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and...
Given a graph with n vertices, k terminals and positive integer weights not larger than c, we comput...
AbstractWe present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with v...
We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree prob...
An efficient evaluation method is described for polynomials in finite fields. Its complexity is show...
This chapter is devoted to compact extended formulations of tree problems. First, we give a compact ...
AbstractWe present and illustrate by a sequence of examples an algorithm paradigm for solving NP- ha...
Abstract. We propose a polynomial-time-delay polynomial-space algorithm to enumerate all efficient e...
In this paper we present techniques that result in O(n) time algorithms for computing many propertie...
We show that for any k there is a polynomial time algorithm to evaluate the weighted graph polyno...
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this arti...
International audienceThe construction of a spanning tree is a fundamental task in distributed syste...
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
In this paper we consider the probable performance of three polynomial time approximation algorithm...
AbstractGiven integers a, b, c, d, we present a polynomial algorithm for the query “is ab ≥ cd?”. Th...
DOI
Add to ORKG