Improved Limited Discrepancy Search

@inproceedings{Korf1996ImprovedLD,
  title={Improved Limited Discrepancy Search},
  author={Richard E. Korf},
  booktitle={AAAI/IAAI, Vol. 1},
  year={1996}
}
We present an improvement to Harvey and Ginsberg’s limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from the root to the maximum search depth only once. For a complete binary tree of depth d, this reduces the asymptotic complexity from O(y2”) to O(2”). Th e savings is much less in a partial tree search, or in a heavily pruned tree. The overhead of the improved algorithm on a complete b-ary tree is only a factor of b/(b 1… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 116 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

117 Citations

051015'96'01'07'13
Citations per Year
Semantic Scholar estimates that this publication has 117 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

The differencing method of set partitioning

  • Karmarkar, R. M. Karp
  • Technical Report UCB/CSD 82/113,
  • 1982
1 Excerpt

Similar Papers

Loading similar papers…