Vote for your favorite mineral in #MinCup25! - Baryte vs. Hematite
It's a heavyweight match between industrial powerhouses as soft #baryte competes against rusty red #hematite.
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

Aumann, Yonatan, Rabani, Yuval (1998) An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM Journal on Computing, 27 (1). 291-301 doi:10.1137/s0097539794285983

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleAn O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
JournalSIAM Journal on Computing
AuthorsAumann, YonatanAuthor
Rabani, YuvalAuthor
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794285983Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240165Long-form Identifiermindat:1:5:11240165:2
GUID0
Full ReferenceAumann, Yonatan, Rabani, Yuval (1998) An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM Journal on Computing, 27 (1). 291-301 doi:10.1137/s0097539794285983
Plain TextAumann, Yonatan, Rabani, Yuval (1998) An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM Journal on Computing, 27 (1). 291-301 doi:10.1137/s0097539794285983
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.

Garg, Naveen, Vazirani, Vijay V., Yannakakis, Mihalis (1996) Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM Journal on Computing, 25 (2). 235-251 doi:10.1137/s0097539793243016
Grandoni, Fabrizio, Laekhanukit, Bundit, Li, Shi (2023) $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. SIAM Journal on Computing, 52 (2) doi:10.1137/20m1312988
Fakcharoenphol, Jittat, Laekhanukit, Bundit (2012) An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem. SIAM Journal on Computing, 41 (5). 1095-1109 doi:10.1137/110855910
Calinescu, Gruia, Karloff, Howard, Rabani, Yuval (2005) Approximation Algorithms for the 0-Extension Problem. SIAM Journal on Computing, 34 (2). 358-372 doi:10.1137/s0097539701395978
Asadpour, Arash, Saberi, Amin (2010) An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods. SIAM Journal on Computing, 39 (7). 2970-2989 doi:10.1137/080723491
Kushilevitz, Eyal, Ostrovsky, Rafail, Rabani, Yuval (2000) Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM Journal on Computing, 30 (2). 457-474 doi:10.1137/s0097539798347177
Brady, Martin L. (1998) A Fast Discrete Approximation Algorithm for the Radon Transform. SIAM Journal on Computing, 27 (1). 107-119 doi:10.1137/s0097539793256673
Karloff, Howard (1999) How Good is the Goemans--Williamson MAX CUT Algorithm?. SIAM Journal on Computing, 29 (1). 336-350 doi:10.1137/s0097539797321481
Blum, Avrim, Karloff, Howard, Rabani, Yuval, Saks, Michael (2000) A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. SIAM Journal on Computing, 30 (5). 1624-1661 doi:10.1137/s0097539799351882
Kleinberg, Jon, Rabani, Yuval, Tardos, Éva (2000) Allocating Bandwidth for Bursty Connections. SIAM Journal on Computing, 30 (1). 191-217 doi:10.1137/s0097539797329142
Lokshtanov, Daniel, Saurabh, Saket, Surianarayanan, Vaishali (2024) A Parameterized Approximation Scheme for Min $k$-Cut. SIAM Journal on Computing, 53 (6). doi:10.1137/20m1383197
 
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 19, 2025 10:56:24
Go to top of page