356 search results - page 19 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
JDA
2008
13 years 7 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
14 years 2 months ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
JGAA
2007
13 years 7 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...