Finding a minimum weight K-link path in graphs with Monge property and applications

Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama

研究成果: Conference contribution

25 引用 (Scopus)

抜粋

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) log3 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 191993 5 21

出版物シリーズ

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

Other

OtherProceedings of the 9th Annual Symposium on Computational Geometry
San Diego, CA, USA
期間93/5/1993/5/21

ASJC Scopus subject areas

  • Engineering(all)

これを引用

Aggarwal, A., Schieber, B., & Tokuyama, T. (1993). Finding a minimum weight K-link path in graphs with Monge property and applications. : 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