Open AccessFast greedy for linear matroids
Author(s) -
Huy L. Nguyên
Publication year - 2019
Publication title -
society for industrial and applied mathematics ebooks
Language(s) - Uncategorized
Resource type - Book series
DOI - 10.1137/1.9781611975482.32
Subject(s) - matroid , greedy algorithm , time complexity , graphic matroid , rank (graph theory) , base (topology) , exponent , mathematics , combinatorics , matrix multiplication , representation (politics) , matrix (chemical analysis) , discrete mathematics , weighted matroid , matroid partitioning , algorithm , law , physics , philosophy , composite material , linguistics , mathematical analysis , quantum , politics , quantum mechanics , political science , materials science
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom