Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

SODA
2016
ACM

favoriteEmaildiscussreport

65views Algorithms» more SODA 2016»

A Fast Approximation for Maximum Weight Matroid Intersection

8 years 17 days ago

A Fast Approximation for Maximum Weight Matroid Intersection

Download web.engr.illinois.edu

We present an approximation algorithm for the maximum weight matroid intersection problem in the independence oracle model. Given two matroids deﬁned over a common ground set N of n elements, let k be the rank of the matroid intersection and let Q denote the cost of an independence query for either matroid. An exact algorithm for ﬁnding a maximum cardinality independent set (the unweighted case), due

Chandra Chekuri, Kent Quanrud

Real-time Traffic

Algorithms | SODA 2016 |

claim paper

Related Content

» The complexity of maximum matroidgreedoid intersection and weighted greedoid maximization

» The Complexity of Maximum MatroidGreedoid Intersection

» Matroid Representation of Clique Complexes

» Evolutionary algorithms and matroid optimization problems

» A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

» Greedy in Approximation Algorithms

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» Approximating and Intersecting Surfaces from Points

» Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...

» Iterative Rounding for MultiObjective Optimization Problems

Post Info
More Details (n/a)

Added	09 Apr 2016
Updated	09 Apr 2016
Type	Journal
Year	2016
Where	SODA
Authors	Chandra Chekuri, Kent Quanrud

Comments (0)