Add to ORKGThe problems of (classical) searching and connected searching of weighted trees are known to be computationally hard. In this work we give a polynomial-time 3-approximation algorithm that nds a connected search strategy of a given weighted tree. This in particular yields constant factor approximation algorithms for the (non-connected) classical searching problems and for the weighted pathwidth problem for this class of graphs
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
AbstractIn this paper we consider the edge ranking problem of weighted trees. We prove that a specia...
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted t...
AbstractThe problems of (classical) searching and connected searching of weighted trees are known to...
In this paper we consider the problem of connected edge searching of weighted trees. Barrière et al...
International audienceWe consider the following generalization of the binary search problem. A searc...
AbstractIn this paper we consider the problem of connected edge searching of weighted trees. Barrièr...
We consider a generalization of binary search in linear orders to the domain of weighted trees. The ...
We present a technique that allows for improving on some relative greedy procedures by well-chosen (...
Abstract: In this paper we consider the edge ranking problem of weighted trees. We prove that a spec...
Approximation algorithms have so far mainly been studied for problems that are not known to have pol...
In this paper, we present fast distributed approximation algorithms for matching in weighted trees a...
In this paper we consider the edge ranking problem of weighted trees. We prove that a special instan...
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a t...
[[abstract]]In this paper, three types of problems for single-step searching weighted graphs are def...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
AbstractIn this paper we consider the edge ranking problem of weighted trees. We prove that a specia...
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted t...
AbstractThe problems of (classical) searching and connected searching of weighted trees are known to...
In this paper we consider the problem of connected edge searching of weighted trees. Barrière et al...
International audienceWe consider the following generalization of the binary search problem. A searc...
AbstractIn this paper we consider the problem of connected edge searching of weighted trees. Barrièr...
We consider a generalization of binary search in linear orders to the domain of weighted trees. The ...
We present a technique that allows for improving on some relative greedy procedures by well-chosen (...
Abstract: In this paper we consider the edge ranking problem of weighted trees. We prove that a spec...
Approximation algorithms have so far mainly been studied for problems that are not known to have pol...
In this paper, we present fast distributed approximation algorithms for matching in weighted trees a...
In this paper we consider the edge ranking problem of weighted trees. We prove that a special instan...
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a t...
[[abstract]]In this paper, three types of problems for single-step searching weighted graphs are def...
The classical Steiner tree problem in weighted graphs seeks a mini-mum weight connected subgraph con...
AbstractIn this paper we consider the edge ranking problem of weighted trees. We prove that a specia...
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted t...