Sciweavers

14158 search results - page 395 / 2832
» Generalized switch-setting problems
Sort
View
146
Voted
AUTOMATICA
2004
104views more  AUTOMATICA 2004»
15 years 4 months ago
Dynamics and stability in optical communication networks: a system theory framework
This paper addresses the problem of dynamics analysis in optical networks from a system control perspective. A general framework for
Lacra Pavel
125
Voted
MP
1998
105views more  MP 1998»
15 years 4 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
MST
2010
187views more  MST 2010»
14 years 11 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
ICCSA
2004
Springer
15 years 10 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
Hu Zhang
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
15 years 4 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...