Sciweavers

631 search results - page 14 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 3 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
14 years 3 months ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
13 years 10 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
14 years 2 months ago
Comparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
ICALP
2004
Springer
14 years 2 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp