{"id":"https://openalex.org/W2068796193","doi":"https://doi.org/10.1007/bf01585865","title":"Random sampling and greedy sparsification for matroid optimization problems","display_name":"Random sampling and greedy sparsification for matroid optimization problems","publication_year":1998,"publication_date":"1998-06-01","ids":{"openalex":"https://openalex.org/W2068796193","doi":"https://doi.org/10.1007/bf01585865","mag":"2068796193"},"language":"en","primary_location":{"id":"doi:10.1007/bf01585865","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585865","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":["Laboratory for Computer Science, MIT, 02139, Cambridge, MA, USA","Laboratory for Computer Science, MIT, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, 02139, Cambridge, MA, USA","institution_ids":[]},{"raw_affiliation_string":"Laboratory for Computer Science, MIT, Cambridge, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.0338,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.86761764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"82","issue":"1-2","first_page":"41","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9794085025787354},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.7667827606201172},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6362825036048889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6088693141937256},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.5794285535812378},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5626093149185181},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5610584020614624},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5541382431983948},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.543079137802124},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.5152392983436584},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4977169334888458},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4801056683063507},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46973690390586853},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.4474044144153595},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4274728298187256},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3968677520751953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30057191848754883}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9794085025787354},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.7667827606201172},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6362825036048889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6088693141937256},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.5794285535812378},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5626093149185181},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5610584020614624},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5541382431983948},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.543079137802124},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.5152392983436584},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4977169334888458},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4801056683063507},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46973690390586853},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.4474044144153595},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4274728298187256},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3968677520751953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30057191848754883},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf01585865","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585865","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.3196","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.uni-paderborn.de/~artur/TEACHING/LITERATUR/NETWORK-ALGORITHMS/Karger-Random-Sampling-Matroids.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.2110","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.2110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/karger/Papers/matroid.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W411287429","https://openalex.org/W1511255594","https://openalex.org/W1539230026","https://openalex.org/W1965680834","https://openalex.org/W1969468986","https://openalex.org/W1978099551","https://openalex.org/W1989640573","https://openalex.org/W1991528957","https://openalex.org/W1993388844","https://openalex.org/W2006378656","https://openalex.org/W2011824743","https://openalex.org/W2012287357","https://openalex.org/W2012959686","https://openalex.org/W2022175859","https://openalex.org/W2035228443","https://openalex.org/W2042587503","https://openalex.org/W2042706982","https://openalex.org/W2055391790","https://openalex.org/W2059772103","https://openalex.org/W2068888615","https://openalex.org/W2079522169","https://openalex.org/W2100658172","https://openalex.org/W2107780763","https://openalex.org/W2114651839","https://openalex.org/W2117708188","https://openalex.org/W2117889403","https://openalex.org/W2123720352","https://openalex.org/W2125690626","https://openalex.org/W2138304862","https://openalex.org/W2150516767","https://openalex.org/W2167630072","https://openalex.org/W2168919539","https://openalex.org/W2295330575","https://openalex.org/W2295428206","https://openalex.org/W2295578127","https://openalex.org/W2313388590","https://openalex.org/W2587926013","https://openalex.org/W2751862591","https://openalex.org/W2752885492","https://openalex.org/W2905110430","https://openalex.org/W2911981421","https://openalex.org/W2996041333","https://openalex.org/W3027202947","https://openalex.org/W3142283000","https://openalex.org/W4231916799","https://openalex.org/W4247278211","https://openalex.org/W4251565294","https://openalex.org/W4255288880","https://openalex.org/W4312512934","https://openalex.org/W6637202412","https://openalex.org/W6818618282"],"related_works":["https://openalex.org/W2378157773","https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W2980228156","https://openalex.org/W1978795414","https://openalex.org/W4303709689","https://openalex.org/W2153065381","https://openalex.org/W2058489697","https://openalex.org/W2625145881","https://openalex.org/W2159059797"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}