Sciweavers

1404 search results - page 23 / 281
» Optimization problems in multiple-interval graphs
Sort
View
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
15 years 6 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
JOIN
2007
91views more  JOIN 2007»
15 years 2 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
122
Voted
WG
2004
Springer
15 years 7 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
IOR
2011
107views more  IOR 2011»
14 years 9 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell
JCO
2010
123views more  JCO 2010»
15 years 26 days ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher