A Stab at Approximating Minimum Subadditive Join

@inproceedings{Vinterbo2007ASA,
  title={A Stab at Approximating Minimum Subadditive Join},
  author={Staal A. Vinterbo},
  booktitle={WADS},
  year={2007}
}
Let (L, ∗) be a semilattice, and let c : L → [0,∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k with 1 ≤ k ≤ n, find a size k sub-collection (x1, x ′ 2, . . . , x ′ k) of X that minimizes c(x ′ 1 ∗ x2 ∗ · · · ∗ xk). If c(a ∗ b) ≤ c(a) + c(b) holds, we call this the Minimum Subadditive Join (MSJ) problem and present a greedy (k − p + 1)approximation algorithm requiring O((k − p)n + n) joins for constant integer 0 < p ≤ k… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 15 references

The Computer Based Patient Record: An Essential Technology for Health Care, Revised Edition

  • R. S. Dick, E. B. Steen, D. E. Detmer
  • Institute of Medicine
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…