Sciweavers

261 search results - page 50 / 53
» A randomized polynomial-time simplex algorithm for linear pr...
Sort
View
CN
2007
154views more  CN 2007»
14 years 9 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
14 years 10 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 1 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
TCOM
2010
92views more  TCOM 2010»
14 years 7 months ago
Detection of Gaussian constellations in MIMO systems under imperfect CSI
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
91
Voted
LATIN
2010
Springer
14 years 7 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen