Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2002: Computing and Combinatorics pp 504–513Cite as

New Results on the k-Truck Problem

  • Conference paper
  • First Online:

  • 573 Accesses

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

Abstract

In this paper, some results concerning the k-truck problem are produced. First, the algorithms and their complexity concerning the off-line k-truck problem are discussed. Following that, a lower bound of competitive ratio for the on-line k-truck problem is given. Based on the Position Maintaining Strategy (PMS), we get some new results which are slightly better than those of [1] for general cases. We also use the Partial-Greedy Algorithm (PG) to solve this problem on a special line. Finally, we extend the concepts of the on-line k-truck problem to obtain a new variant: Deeper On-line k-Truck Problem (DTP).

The authors would like to acknowledge the support of Central Research Grant GV-975 of the Hong Kong Polytechnic University and Research Grant from NSF of China. No.19731001

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.M. Ma, Y.F. Xu, and K.L. Wang, On-line k-truck problem and its competitive algorithm. Journal of Global Optimization 21(1): 15–25, September 2001.

    Google Scholar 

  2. S. Albers and S. Leonardi. Online algorithms. ACM Computing Surveys Vol.31. Issue 3 Sept. 1999.

    Google Scholar 

  3. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Communication of the ACM, 28 (1985) 202–208.

    Article  MathSciNet  Google Scholar 

  4. A. Karlin, M. Manasse, L. Rudlph and D.D. Sleator. Competitive snoopy caching, Algorithmica, 3:79–119, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  5. M.S. Manasse, L.A. McGeoch, and D.D. Sleator, Competitive algorithms for on-line problems. In Proc. 20th Annual ACM Symp. on Theory of Computing, 322–33, 1988.

    Google Scholar 

  6. M.S. Manasse, L.A. McGeoch, and D.D. Sleator, Competitive algorithms for server problems, Journal of Algorithms, 1990(11), 208–230.

    Google Scholar 

  7. S. Ben-David, S. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the power if randomization in on-line algorithms. In Proc. 22nd Annual ACM Symp. on Theory of Computing, 379–386, 1990.

    Google Scholar 

  8. Y.F. Xu, K.L. Wang, and B. Zhu, On the k-taxi problem, Information, Vol.2, No.4, 1999.

    Google Scholar 

  9. E. Koutsoupias, C. Papadimitriou, On the k-server conjecture, STOC., 507–511, 1994.

    Google Scholar 

  10. M. Chrobak, L. Larmore, An optimal algorithm for the server problem on trees, SIAM Journal of Computing 20 (1991)144–148.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan, New results on the server problem, SIAM Journal on Discrete Mathematics 4 (1991) 172–181.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, 1983, 109–111.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, Xi’an Jiaotong University, Shaanxi, 710049, PRC

    Weimin Ma, Yinfeng Xu & Kanliang Wang

  2. Dept. of Computing, Hong Kong Polytechnic Uinversity, Hung Hom, Kowloon, Hong Kong

    Weimin Ma, Jane You & James Liu

Authors
  1. Weimin Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jane You
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. James Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kanliang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, W., Xu, Y., You, J., Liu, J., Wang, K. (2002). New Results on the k-Truck Problem. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation