skip to main content
research-article

Problems

Published:01 May 1997Publication History
Skip Abstract Section

Abstract

This column will carry problems arising in the design of algorithms for discrete problems.Problems are solicited in all areas of algorithm design that are covered byJournal of Algorithms. Some of the problems that appear here may also appear in the “Open Problems” column inSIGACT News. Problems should be submitted to me at the Department of Computer Science, University of Maryland, College Park, MD 20742 (E-mail: [email protected]), and if chosen, will appear in this column. I hope that there will be enough submissions to run this column twice a year. Problem submissions should be precise and succinct. Proposals for guest columns, focusing on problems in a specific research area, are also welcome.Especially welcome are algorithmic problems arising in areas not previously explored by the theoretical computer science community.I have taken over this column from Professor Peter van Emde Boas and I thank him for his efforts in running the column over the past few years.

References

  1. AL970847RF1 A. Aggarwal, A. Bar-Noy, S. Khuller, D. Kravets, B. Schieber, Efficient minimum cost matching and transportation using the quadrangle inequality, J. Algorithms, 19 (1995) 116-143.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. AL970847RF2 P. Agarwal, A. Efrat, M. Sharir, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, 1995.Google ScholarGoogle Scholar
  3. AL970847RF3 A.V. Aho, J.E. Hopcroft, J.D. Ullman, , Addison¿Wesley, Reading, 1974.Google ScholarGoogle Scholar
  4. AL970847RF4 S. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, N. Young, A network flow technique for finding low-weight bounded-degree spanning trees, J. AlgorithmsGoogle ScholarGoogle Scholar
  5. AL970847RF5 S. Khuller, B. Raghavachari, N. Young, Low degree spanning trees of small weight, SIAM J. Comput., 25 (1996) 355-368.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. AL970847RF6 C. Monma, S. Suri, Transitions in geometric minimum spanning trees, Discrete Comput. Geom., 8 (1992) 265-293.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. AL970847RF7 P. Vaidya, Geometry helps in matching, SIAM J. Comput., 18 (1989) 1201-1225.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Problems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Journal of Algorithms
      Journal of Algorithms  Volume 23, Issue 2
      May. 1997
      199 pages
      ISSN:0196-6774
      Issue’s Table of Contents

      Copyright © Academic Press

      Publisher

      Academic Press, Inc.

      United States

      Publication History

      • Published: 1 May 1997

      Qualifiers

      • research-article
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics