Sciweavers

3341 search results - page 48 / 669
» On Bounded Queries and Approximation
Sort
View
128
Voted
MFCS
2005
Springer
15 years 9 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
101
Voted
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
15 years 8 months ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
WG
2001
Springer
15 years 8 months ago
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
67
Voted
INFOCOM
1996
IEEE
15 years 7 months ago
Bounds, Approximations and Applications for A Two-Queue GPS System
Francesco Lo Presti, Zhi-Li Zhang, Donald F. Towsl...
116
Voted
APPROX
2006
Springer
76views Algorithms» more  APPROX 2006»
15 years 7 months ago
Distance Approximation in Bounded-Degree and General Sparse Graphs
Sharon Marko, Dana Ron