Years and Authors of Summarized Original Work
1986; Du, Pan, Shing
Keywords and Synonyms
Technique for constructing approximation
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.
The adaptive partition was first introduced to the design of an approximation algorithm by Du et al.  with a guillotine cut while they studied the minimum edge-length rectangular partition (MELRP)...
KeywordsSteiner Tree Steiner Minimum Tree VLSI Technology Rectilinear Polygon Rectangular Partition
- 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–12Google 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–563Google 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, BerkeleyGoogle Scholar
- 7.Gonzalez T, Zheng SQ (1985) Bounds for partitioning rectilinear polygons. In: Proceedings of the 1st symposium on computational geometryGoogle Scholar
- 9.Lingas A (1983) Heuristics for minimum edge length rectangular partitions of rectilinear figures. In: Proceedings of the 6th GI-conference, Dortmund. SpringerGoogle 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, IllinoisGoogle 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–408Google 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 BrookGoogle Scholar