Sciweavers

14158 search results - page 214 / 2832
» Generalized switch-setting problems
Sort
View
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 8 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
114
Voted
4OR
2007
103views more  4OR 2007»
15 years 3 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti
116
Voted
COR
2010
123views more  COR 2010»
15 years 3 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
123
Voted
TIT
2008
74views more  TIT 2008»
15 years 3 months ago
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem
We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digita...
Aaron B. Wagner, Saurabha Tavildar, Pramod Viswana...
131
Voted
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
15 years 9 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang