Sciweavers

7150 search results - page 35 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
128
Voted
IPCO
2004
144views Optimization» more  IPCO 2004»
15 years 1 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 10 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
96
Voted
CCCG
2006
15 years 1 months ago
A Simple Streaming Algorithm for Minimum Enclosing Balls
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
Hamid Zarrabi-Zadeh, Timothy M. Chan
227
Voted
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 1 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
95
Voted
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 7 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...