Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 1–6Cite as

Adaptive Partitions

  • Living reference work entry
  • First Online:

  • 726 Accesses

Years and Authors of Summarized Original Work

1986; Du, Pan, Shing

Keywords and Synonyms

Technique for constructing approximation

Problem Definition

Adaptive partition is one of major techniques to design polynomial-time approximation algorithms, especially polynomial-time approximation schemes for geometric optimization problems. The framework of this technique is to put the input data into a rectangle and partition this rectangle into smaller rectangles by a sequence of cuts so that the problem is also partitioned into smaller ones. Associated with each adaptive partition, a feasible solution can be constructed recursively from solutions in smallest rectangles to bigger rectangles. With dynamic programming, an optimal adaptive partition is computed in polynomial time.

Historical Note

The adaptive partition was first introduced to the design of an approximation algorithm by Du et al. [4] with a guillotine cut while they studied the minimum edge-length rectangular partition (MELRP)...

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

Recommended Reading

  1. Arora S (1996) Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 37th IEEE symposium on foundations of computer science, pp 2–12

    Google Scholar 

  2. Arora S (1997) Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 38th IEEE symposium on foundations of computer science, pp 554–563

    Google Scholar 

  3. Arora S (1998) Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J ACM 45:753–782

    Article  MATH  MathSciNet  Google Scholar 

  4. Du D-Z, Pan, L-Q, Shing, M-T (1986) Minimum edge length guillotine rectangular partition. Technical report 0241886, Math. Sci. Res. Inst., Univ. California, Berkeley

    Google Scholar 

  5. Du D-Z, Hsu DF, Xu K-J (1987) Bounds on guillotine ratio. Congressus Numerantium 58: 313–318

    MathSciNet  Google Scholar 

  6. Du DZ, Hwang FK, Shing MT, Witbold T (1988) Optimal routing trees. IEEE Trans Circuits 35:1335–1337

    Article  Google Scholar 

  7. Gonzalez T, Zheng SQ (1985) Bounds for partitioning rectilinear polygons. In: Proceedings of the 1st symposium on computational geometry

    Google Scholar 

  8. Gonzalez T, Zheng SQ (1989) Improved bounds for rectangular and guillotine partitions. J Symb Comput 7:591–610

    Article  MATH  MathSciNet  Google Scholar 

  9. Lingas A (1983) Heuristics for minimum edge length rectangular partitions of rectilinear figures. In: Proceedings of the 6th GI-conference, Dortmund. Springer

    Google Scholar 

  10. Lingas A, Pinter RY, Rivest RL, Shamir A (1982) Minimum edge length partitioning of rectilinear polygons. In: Proceedings of the 20th Allerton conference on communication, control, and computing, Illinois

    Google Scholar 

  11. Min M, Huang SC-H, Liu J, Shragowitz E, Wu W, Zhao Y, Zhao Y (2003) An approximation scheme for the rectilinear Steiner minimum tree in presence of obstructions. Fields Inst Commun 37:155–164

    MathSciNet  Google Scholar 

  12. Mitchell JSB (1996) Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem. In: Proceedings of the 7th ACM-SIAM symposium on discrete algorithms, pp 402–408

    Google Scholar 

  13. Mitchell JSB (1997) Guillotine subdivisions approximate polygonal subdivisions: part III – faster polynomial-time approximation scheme for geometric network optimization, manuscript, State University of New York, Stony Brook

    Google Scholar 

  14. Mitchell JSB (1999) Guillotine subdivisions approximate polygonal subdivisions: part II – a simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problem. SIAM J Comput 29(2):515–544

    Article  MathSciNet  Google Scholar 

  15. Mitchell JSB, Blum A, Chalasani P, Vempala S (1999) A constant-factor approximation algorithm for the geometric k-MST problem in the plane. SIAM J Comput 28(3):771–781

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, USA

    Ping Deng & Weili Wu

  2. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA

    Eugene Shragowitz

  3. Computer Science, University of Minnesota, 200 Union Street S.E., 55455, Minneapolis, USA

    Ding-Zhu Du

Authors
  1. Ping Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eugene Shragowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ding-Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Deng, P., Wu, W., Shragowitz, E., Du, DZ. (2014). Adaptive Partitions. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_2-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_2-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation