1404 search results - page 45 / 281 » Optimization problems in multiple-interval graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
ORL
2006
14 years 9 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
92
Voted
ISAAC
1998
Springer
15 years 1 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...