### 抜粋

Let G be a weighted, complete, directed acyclic graph (DAG), whose edge weights obey the Monge condition. We give an efficient algorithm for finding the minimum weight K-link path between a given pair of vertices for any given K. The time complexity of our algorithm is O(n√K log n) for the concave case and O(nα(n) log^{3} n) for the convex case. Our algorithm uses some properties of DAGs with Monge property together with a refined parametric search technique. We apply our algorithm (for the concave case) to get efficient solutions for the following problems, improving on previous results: (1) Finding the largest K-gon contained in a given polygon. (2) Finding the smallest K-gon that is the intersection of K halfplanes out of given set of halfplanes defining an n-gon. (3) Computing maximum K-cliques of an interval graph. (4) Computing length limited Huffman codes. (5) Computing optimal discrete quantization.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Proceedings of the 9th Annual Symposium on Computational Geometry |

出版者 | Publ by ACM |

ページ | 189-197 |

ページ数 | 9 |

ISBN（印刷物） | 0897915828, 9780897915823 |

DOI | |

出版物ステータス | Published - 1993 |

イベント | Proceedings of the 9th Annual Symposium on Computational Geometry - San Diego, CA, USA 継続期間: 1993 5 19 → 1993 5 21 |

### 出版物シリーズ

名前 | Proceedings of the 9th Annual Symposium on Computational Geometry |
---|

### Other

Other | Proceedings of the 9th Annual Symposium on Computational Geometry |
---|---|

市 | San Diego, CA, USA |

期間 | 93/5/19 → 93/5/21 |

### ASJC Scopus subject areas

- Engineering(all)

## これを引用

*Proceedings of the 9th Annual Symposium on Computational Geometry*(pp. 189-197). (Proceedings of the 9th Annual Symposium on Computational Geometry). Publ by ACM. https://doi.org/10.1145/160985.161135