%%% ====================================================================
%%%  @LaTeX-file{
%%%     filename  = "kargerkt95.ltx",
%%%     date      = "20 November 1995",
%%%     time      = "21:41:32 EST",
%%%     author    = "David M. Jones",
%%%     email     = "jacm@theory.lcs.mit.edu",
%%%     url       = "http://theory.lcs.mit.edu/~jacm/",
%%%     address   = "Journal of the ACM
%%%                  MIT Laboratory for Computer Science
%%%                  Room NE43-316
%%%                  545 Technology Square
%%%                  Cambridge, MA 02139
%%%                  USA",
%%%     telephone = "(617) 253-5936",
%%%     FAX       = "(617) 253-3480",
%%%     checksum  = "62548 100 371 3277",
%%%     codetable = "ISO/ASCII",
%%%     supported = "yes",
%%%     docstring = "Copyright (c) 1995 by ACM, Inc.
%%%                  Permission to make digital or hard copies of part
%%%                  or all of this work for personal or classroom use
%%%                  is granted without fee provided that copies are
%%%                  not made or distributed for profit or direct
%%%                  commercial advantage and that copies bear this
%%%                  notice and the full citation on the first page.
%%%                  Copyrights for components of this work owned by
%%%                  others than ACM must be honored. Abstracting with
%%%                  credit is permitted. To copy otherwise, to
%%%                  republish, to post on servers, or to redistribute
%%%                  to lists, requires prior specific permission
%%%                  and/or a fee. Request permissions from
%%%                  Publications Dept, ACM Inc., fax +1 (212)
%%%                  869-0481, or permissions@acm.org.
%%%                  
%%%                  This is a LaTeX2e file.  To process it, you will
%%%                  need a copy of the acmabs document class, which is
%%%                  available via the following URL:
%%%
%%%                  http://theory.lcs.mit.edu/~jacm/acmart/acmabs.cls
%%%                  ",
%%%  }
%%% ====================================================================

\documentclass{acmabs}

\begin{document}

\Journal{Journal of the ACM}

\refkey{KargerKT95}

\title{A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees}

\author{David~R. Karger \and Philip~N. Klein \and Robert~E. Tarjan}

\Pages{321--328}

\Month{March}

\Year{1995}

\Volume{42}

\Number{2}

\maketitle

\begin{abstract}

We present a randomized linear-time algorithm to find a minimum spanning tree
  in a connected graph with edge weights. The algorithm uses random sampling in
  combination with a recently discovered linear-time algorithm for verifying a
  minimum spanning tree. Our computational model is a unit-cost random-access
  machine with the restriction that the only operations allowed on edge weights
  are binary comparisons.

\end{abstract}

\begin{categories}

F.2.2[computations on discrete structures]; G.2.2[graph algorithms, network
  problems, trees]; G.3[probabilistic algorithms (including Monte Carlo)],
  I.5.3

\end{categories}

\begin{terms}

Algorithms

\end{terms}

\begin{keywords}

Matroid, minimum spanning tree, network, randomized algorithm

\end{keywords}

\end{document}
