Sciweavers

337 search results - page 14 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
WWW
2007
ACM
14 years 8 months ago
Supervised rank aggregation
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
Yu-Ting Liu, Tie-Yan Liu, Tao Qin, Zhiming Ma, Han...
TMC
2008
104views more  TMC 2008»
13 years 7 months ago
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
FSTTCS
2004
Springer
14 years 27 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
WINE
2007
Springer
161views Economy» more  WINE 2007»
14 years 1 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 9 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang