36 search results - page 6 / 8 » On the integrality ratio for tree augmentation |
SSD
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
ACL
2009
13 years 3 months ago
2009
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
FSTTCS
2009
Springer
14 years 10 days 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...
ICCAD
1996
IEEE
13 years 10 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...