Sciweavers

841 search results - page 30 / 169
» Approximability of Minimum AND-Circuits
Sort
View
JGAA
2000
179views more  JGAA 2000»
13 years 8 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
NETWORKS
2002
13 years 8 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 9 months ago
BER and Outage Probability Approximations for LMMSE Detectors on Correlated MIMO Channels
This paper is devoted to the study of the performance of the linear minimum mean-square error (LMMSE) receiver for (receive) correlated multiple-input multiple-output (MIMO) system...
Abla Kammoun, Malika Kharouf, Walid Hachem, Jamal ...
ECRTS
2009
IEEE
13 years 6 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
PROPERTYTESTING
2010
13 years 6 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon