Sciweavers

14161 search results - page 207 / 2833
» On generalized middle-level problem
Sort
View
4OR
2007
103views more  4OR 2007»
15 years 5 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
COR
2010
123views more  COR 2010»
15 years 5 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
TIT
2008
74views more  TIT 2008»
15 years 5 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...
JDA
2010
122views more  JDA 2010»
15 years 5 days ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
15 years 11 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