Sciweavers

26 search results - page 2 / 6
» Class Constrained Bin Covering
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 9 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
NETWORKS
2011
13 years 22 days ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 5 months ago
Capacity of a Class of Deterministic Relay Channels
Abstract-- The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y , the relay output Y1 = f(X, Y ), and a separate communicatio...
Thomas M. Cover, Young-Han Kim
BROADNETS
2006
IEEE
13 years 12 months ago
Coverage with Connectivity in Wireless Sensor Networks
— In this paper, we study coverage with connectivity properties in large wireless sensor networks. We consider three classes: full coverage with connectivity, partial coverage wi...
Xin Liu
SOICT
2010
13 years 15 days ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...