Sciweavers

3192 search results - page 15 / 639
» The minimum latency problem
Sort
View
WG
2009
Springer
15 years 4 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
JCO
2010
123views more  JCO 2010»
14 years 8 months 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
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 4 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
JGAA
2006
72views more  JGAA 2006»
14 years 9 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
NETWORKS
2010
14 years 8 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller