Sciweavers

77 search results - page 2 / 16
» An exact algorithm for the capacitated vertex p-center probl...
Sort
View
JGO
2011
87views more  JGO 2011»
13 years 12 days ago
An exact algorithm for solving the vertex separator problem
Mohamed Didi Biha, Marie-Jean Meurs
INFORMS
2010
125views more  INFORMS 2010»
13 years 3 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
13 years 11 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
ISQED
2005
IEEE
81views Hardware» more  ISQED 2005»
13 years 11 months ago
Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer
Due to the rapid development of manufacturing process technology and tight marketing schedule, the chip design and manufacturing always work toward an integrated solution to achie...
Hua Xiang, Kai-Yuan Chao, Martin D. F. Wong
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 5 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...