Work with interactive mapping tools from across the Census Bureau.
Read briefs and reports from Census Bureau experts.
Watch Census Bureau vignettes, testimonials, and video files.
Read research analyses from Census Bureau experts.
Developer portal to access services and documentation for the Census Bureau's APIs.
Explore Census Bureau data on your mobile device with interactive tools.
Find a multitude of DVDs, CDs and publications in print by topic.
These external sites provide more data.
Download extraction tools to help you get the in-depth data you need.
Explore Census data with interactive visualizations covering a broad range of topics.
Information about the U.S. Census Bureau.
Information about what we do at the U.S. Census Bureau.
Learn about other opportunities to collaborate with us.
Explore the rich historical background of an organization with roots almost as old as the nation.
Explore prospective positions available at the U.S. Census Bureau.
Information about the current field vacancies available at the U.S. Census Bureau Regional Offices.
Discover the latest in Census Bureau data releases, reports, and events.
The Census Bureau's Director writes on how we measure America's people, places and economy.
Find interesting and quirky statistics regarding national celebrations and major events.
Find media toolkits, advisories, and all the latest Census news.
See what's coming up in releases and reports.
Most combinatorial problems are very big - bigger than what can be handled efficiently on most fast computers - and hence the development and implementation of fast algorithms is very important. The DISCRETE edit system, based on the Fellegi and Holt model (1976) of editing, contains a combinatorial problem: the set covering problem (SCP). The two major components of the edit system are edit generation and error localization. The SCP is formulated many times in both components. Therefore, an efficient set covering algorithm is critical to the overall performance of the DISCRETE edit system. The preorder of traversing a tree is one of the structures used in the design of a set covering algorithm for the DISCRETE edit system. In this paper, we will describe a simple implementation of the preorder of traversing a tree used in a new set covering algorithm proposed by Chen (1998).