Vote for your favorite mineral in #MinCup25! - Pollucite vs. Tugtupite
It's the cesium #pollucite against the optical changeling #tugtupite for this match.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Buss, Samuel R., Yianilos, Peter N. (1998) Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. SIAM Journal on Computing, 27 (1). 170-201 doi:10.1137/s0097539794267243

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleLinear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours
JournalSIAM Journal on Computing
AuthorsBuss, Samuel R.Author
Yianilos, Peter N.Author
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794267243Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240152Long-form Identifiermindat:1:5:11240152:2
GUID0
Full ReferenceBuss, Samuel R., Yianilos, Peter N. (1998) Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. SIAM Journal on Computing, 27 (1). 170-201 doi:10.1137/s0097539794267243
Plain TextBuss, Samuel R., Yianilos, Peter N. (1998) Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. SIAM Journal on Computing, 27 (1). 170-201 doi:10.1137/s0097539794267243
In(1998, February) SIAM Journal on Computing Vol. 27 (1) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Dyer, M. E. (1984) Linear Time Algorithms for Two- and Three-Variable Linear Programs. SIAM Journal on Computing, 13 (1). 31-45 doi:10.1137/0213003
Megiddo, Nimrod (1983) Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems. SIAM Journal on Computing, 12 (4). 759-776 doi:10.1137/0212052
Bonet, Maria Luisa, Buss, Samuel R. (1995) The Serial Transitive Closure Problem for Trees. SIAM Journal on Computing, 24 (1). 109-122 doi:10.1137/s0097539792225303
Garay, Juan A., Kutten, Shay, Peleg, David (1998) A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 27 (1). 302-316 doi:10.1137/s0097539794261118
Ferragina, Paolo, Grossi, Roberto (1998) Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM Journal on Computing, 27 (3). 713-736 doi:10.1137/s0097539795286119
Barnes, Greg, Buss, Jonathan F., Ruzzo, Walter L., Schieber, Baruch (1998) A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SIAM Journal on Computing, 27 (5). 1273-1282 doi:10.1137/s0097539793283151
Végh, László A. (2016) A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives. SIAM Journal on Computing, 45 (5). 1729-1761 doi:10.1137/140978296
Grandjean, Etienne (1994) Linear Time Algorithms and NP-Complete Problems. SIAM Journal on Computing, 23 (3). 573-597 doi:10.1137/s0097539791223206
Cole, Richard, Hariharan, Ramesh (2003) Tree Pattern Matching to Subset Matching in Linear Time. SIAM Journal on Computing, 32 (4). 1056-1066 doi:10.1137/s0097539700382704
Eidenbenz, Stephan J., Widmayer, Peter (2003) An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM Journal on Computing, 32 (3). 654-670 doi:10.1137/s0097539702405139
Shamir, Adi (1979) A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs. SIAM Journal on Computing, 8 (4). 645-655 doi:10.1137/0208051
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 8, 2025 07:40:27
Go to top of page