Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

How to treat delete requests in semi-online problems

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, N.J., 1992.

    Google Scholar 

  2. Buchsbaum, A.L., P.C. Kanellakis, and J.S. Vitter, A data structure for arc insertion and regular path finding, ACM/SIAM SODA, (1990), pp. 22–31.

    Google Scholar 

  3. Dai, Y., H. Imai, K. Iwano, N. Katoh, K. Ohtsuka, and N. Yoshimura, A new unified approximate approach to the minimum cut problem and its variants using minimum range cut algorithms, manuscript, 1992.

    Google Scholar 

  4. Eppstein, D., Offline algorithms for dynamic minimum spanning tree problems, WADS, LNCS 519 Springer-Verlag, (1991), pp. 392–399.

    Google Scholar 

  5. Eppstein, D., G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a minimum spanning forest in a dynamic planar graph. ACM/SIAM SODA, (1990), pp. 1–11.

    Google Scholar 

  6. Fiduccia, C.M. and R.M. Mattheyses, A linear time heuristic for improving network partitions, ACM/IEEE DAC, (1982), pp. 175–181.

    Google Scholar 

  7. Frederickson, G.N., Data structures for on-line updating of minimum spanning trees, SIAM J. Computing, 14 (1985), pp. 781–798.

    Google Scholar 

  8. Fredman, M.L. and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, JACM, Vol. 34, No. 3, (1987) pp. 596–615.

    Article  Google Scholar 

  9. Garey, M.R. and D.S. Johnson, Computers and Intractability — A Guide to the Theory of NP-completeness, W. H. Freeman and Company, New York, NY, 1979.

    Google Scholar 

  10. Katoh, N. and K. Iwano, Efficient algorithms for minimum range cut problems, WADS, LNCS 519 Springer-Verlag, (1991), pp. 80–91.

    Google Scholar 

  11. Kernighan, B.W. and S. Lin, An effective heuristic procedure for partitioning graphs, BSTJ, Vol. 49, No.2, (1970), pp. 291–307.

    Google Scholar 

  12. Lawler, E.L., A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem, Management Science, Vol. 18, 1972, pp. 401–405.

    Google Scholar 

  13. Martello, S., W.R. Pulleyblank, P. Toth, and D. de Werra, Balanced optimization problems. Operations Research Letters, Vol. 3, No. 5, 275–278. 1984.

    Article  Google Scholar 

  14. Martello, S. and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, West Sussex, England, 1990.

    Google Scholar 

  15. Papadimitriou, C.H. and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.

    Google Scholar 

  16. Sleator, D.D. and R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences, 26, pp. 362–391, (1983).

    Article  Google Scholar 

  17. Tarjan, R.E., Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Management Science, Kobe University of Commerce, 651-21, Kobe, Japan

    Yang Dai & Naoki Katoh

  2. Dept. of Information Science, University of Tokyo, 113, Tokyo, Japan

    Hiroshi Imai

  3. Tokyo Research Laboratory, IBM Japan, 242, Kanagawa, Japan

    Kazuo Iwano

Authors
  1. Yang Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kazuo Iwano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naoki Katoh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dai, Y., Imai, H., Iwano, K., Katoh, N. (1993). How to treat delete requests in semi-online problems. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_234

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_234

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation