Parametric polymatroid optimization and its geometric applications

International Journal of Computational Geometry and Applications

Volumn 12, Issue 5, 2002, Pages 429-443

  Katoh, Naoki ^a   Tamaki, Hisao ^b   Tokuyama, Takeshi ^c  

^a KYOTO UNIVERSITY   (Japan)

^b MEIJI UNIVERSITY   (Japan)

^c TOHOKU UNIVERSITY   (Japan)

Author keywords

Combinatorial geometry; K level; Matroid

Indexed keywords

EID: 0036811613     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195902000967     Document Type: Article

References (26)

1. P. Agarwal, B. Aronov, T. Chan, and M. Sharir, "On Levels in Arrangement of Lines, Segments, Planes, and Triangles," Discrete and Computational Geometry, 19 (1998), pp.315-331.
2. M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, "Crossing-Free Subgraphs," Ann. Discrete Math., 12 (1982), pp.9-12.
3. N. Alon and E. Györi, "The Number of Small Semispaces of a Finite Set of Points in the Plane", J. Combin. Theory A, 41 (1986), pp. 154-157.
4. G.E. Andrews, The Theory of Partitions, Encyclopedia of Mathematics and Its Applications 2, Addison-Wesley 1976.
5. T. Asano and T. Tokuyama, "Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing," Algorithmica, 9 (1993), pp.572-590.
6. P. Carstensen, "Complexity of Some Parametric Integer and Network Programming Problems," Math. Prog., 26 (1983), pp. 64-75.
7. T. Chan, "On Levels in Arrangement of Curves," Proc. 41st IEEE Symp. Foundation of Computer Science, (2000), pp. 219-227.
8. R. Cole, M. Sharir, and C. Yap, "On K-hulls and Related Problems," SIAM J. Comput., 16 (1987), pp. 61-77.
9. T. Dey, "Improved Bound on Planar K-sets and K-levels," Discrete and Computational Geometry, 19 (1998), pp. 373-382.
10. D. Eppstein, "Geometric Lower Bounds for Parametric Matroid Optimization," Discrete and Computational Geometry, 20 (1998), pp. 463-476.
11. A. Federgruen and H. Groenevelt, "Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs," Operations Research, 34 (1986), pp. 218-225.
12. S. Fujishige, Submodular Functions and Optimization, Annals of Discrete Mathematics 47, North Holland, 1991.
13. D. Gusfield, "Bound for the Parametric Spanning Tree Problem," Proc. Humbolt Conf. Graph Theory, Combinatorics, and Computing, (1979), pp.173-183.
14. S. Har-Peled, "Taking a Walk in a Planar Arrangement," SIAM J. Comput., 30 (2000), pp. 1341-1367.
15. D. Hochbaum, "Lower and Upper Bounds for the Allocation Problems," Math. of Operations Research, 19 (1994), pp. 390-409.
16. T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches, MIT Press, 1988.
17. N. Katoh and T. Ibaraki, "Resource Allocation Problems," to appear in Handbook of Combinatorial Optimization, Kluwer Academic, 1998.
18. N. Katoh, T. Ibaraki, and H. Mine, "A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Functions," Operational Research Quart., 30 (1979), pp.449-455.
19. N. Katoh, K. Iwano, and T. Tokuyama, "On Minimum and Maximum Spanning Trees of Linearly Moving Points," Discrete and Computational Geometry, 13 (1995), pp.161-176.
20. L. Lovász, "On the Number of Halving Lines," Ann. Univ. Sci. Budapest, Etövös, Sect. Math., 14 (1971), pp. 107-108.
21. N. Megiddo, "Optimal Flows in Networks with Multiple Sources and Sinks," Mathematical Programming, 7 (1974), pp.97-107.
22. K. Murota, System Analysis by Graphs and Matroids, Algorithms and Combinatorics 3, Springer Verlag, 1988.
23. K. Murota, "Convexity and Steinitz's Exchange Property," Advances in Mathematics, 124 (1996), pp. 272-311.
24. H. Tamaki and T. Tokuyama "How to Cut Pseudo Parabolas into Segments," Discrete Comput. Geom., 19 (1998), pp.265-290.
25. H. Tamaki and T. Tokuyama "A Characterization of Planar Graphs by Pseudo-Line Arrangements," Proc. ISAAC97, Springer LNCS 1350 (1997), pp.133-142.
26. E. Welzl, "More on K-sets of Finite Sets in the Plane," Discrete & Computational Geometry, 1 (1986), pp.95-100.