138 search results - page 19 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
HYBRID
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
ALGOSENSORS
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
MST
2007
13 years 7 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...