Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms

ISA 1991: ISA'91 Algorithms pp 199–207Cite as

Dynamic programming on intervals

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 557))

Abstract

We consider problems on intervals which can be solved by dynamic programming. Specifically, we give an efficient implementation of dynamic programming on intervals. As an application, an optimal sequential partition of a graph G=(V, E) can be obtained in O(m log n) time, where n = ¦V¦ and m = ¦E¦. We also present an O(n log n) time algorithm for finding a minimum weight dominating set of an interval graph G=(V, E), and an O(m log n) time algorithm for finding a maximum weight clique of a circular-arc graph G=(V, E), provided their intersection models of n intervals (arcs) are given.

This work was supported in part by Grant in Aid for Scientific Research of the Ministry of Education, Science and Culture of Japan under Grant-in-Aid for Co-operative Research (A) 02302047 (1990,1991).

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Asano, An faster algorithm for finding a maximum weight clique of a circular-arc graph, Technical Report of Institut für Operations Research, Universität Bonn, 90624-OR, 1990.

    Google Scholar 

  2. J.L. Bentley, Decomposable searching problems, Information Processing Letters, 8 (1979), pp. 244–251.

    Google Scholar 

  3. A.A. Bertossi and S. Moretti, Parallel algorithms on circular-arc graphs Information Processing Letters, 33 (1989/1990), pp. 275–281.

    Google Scholar 

  4. W.-L. Hsn, Maximum weight clique algorithms for circular-arc graphs and circle graphs, SIAM Journal on Computing, 14 (1985), pp. 224–231.

    Google Scholar 

  5. T. Kaji and A. Ohuchi, Optimal sequential partitions of graphs by branch and bound, Technical Report 90-AL-10, Information Processing Society of Japan, 1990.

    Google Scholar 

  6. B.W. Kernighan, Optimal sequential partitions of graphs, Journal of ACM, 18 (1971), pp. 34–40.

    Google Scholar 

  7. F.P. Preparata and M.I. Shamos, Computational Geometry: An Intorduction, Springer-Verlag, New York, 1985.

    Google Scholar 

  8. W.-K. Shih and W.-L. Hsu, An O(n log n+m loglog n) maximum weight clique algorithm for circular-arc graphs, Information Processing Letters, 31 (1989), pp. 129–134.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Sophia University, Chiyoda-ku, 102, Tokyo, Japan

    Takao Asano

Authors
  1. Takao Asano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wen-Lian Hsu R. C. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asano, T. (1991). Dynamic programming on intervals. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-54945-5_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54945-1

  • Online ISBN: 978-3-540-46600-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation