Sciweavers

4894 search results - page 71 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
11 years 11 months ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...
ISMIS
2000
Springer
14 years 16 days ago
Design of Rough Neurons: Rough Set Foundation and Petri Net Model
This paper introduces the design of rough neurons based on rough sets. Rough neurons instantiate approximate reasoning in assessing knowledge gleaned from input data. Each neuron c...
James F. Peters, Andrzej Skowron, Zbigniew Suraj, ...
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
14 years 2 days ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin