Matroid - PDFSEARCH.IO - Document Search Engine

Matroid
Results: 395

#	Item
181	Edge-Selection Heuristics for Computing Tutte Polynomials Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:13:27 Graph coloring Polynomials Tutte polynomial Chromatic polynomial Matching Graph property Cycle space Pseudoforest Line graph Graph theory Mathematics Matroid theory
182	Research Statement Yuval Filmus November 6, 2014 1 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-11-06 11:23:26 Matrix theory Numerical linear algebra Submodular set function Matroid Combinatorics Circuit complexity Matrix multiplication State Mathematics Algebra Computational complexity theory
183	Maximum Coverage over a Matroid Constraint Yuval Filmus Justin Ward University of Toronto China Theory Week 2011 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-10-18 11:48:40 Discrete mathematics Matroid Submodular set function Greedy algorithm Greedoid Weighted matroid Matroid theory Mathematics Combinatorics
184	arXiv:1408.0744v1 [math.CO] 4 AugAN Lp THEORY OF SPARSE GRAPH CONVERGENCE II: LD CONVERGENCE, QUOTIENTS, AND RIGHT CONVERGENCE CHRISTIAN BORGS, JENNIFER T. CHAYES, HENRY COHN, AND YUFEI ZHAO Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-08-04 20:27:04 Dense graph Adjacency matrix Matroid theory Calculus Graph theory Mathematics Graph
185	Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus∗ and Justin Ward† December 30, 2013 Abstract Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-12-30 15:39:21 Mathematical optimization Submodular set function Operations research Convex optimization Matroid Linear programming Greedy algorithm Algorithm Greedoid Mathematics Matroid theory Combinatorics
186	Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd . Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 00:53:54 Finite fields Computational geometry Matroid theory Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Mathematics Polynomials Elliptic curves
187	20th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms AOFA’09 June, Add to Reading List Source URL: aofa2009.greyc.fr Language: English - Date: 2009-06-15 08:15:19 Stochastic processes Random walk Minimum spanning tree Planar graph Random geometric graph Graph Normal distribution Combinatorics Matroid theory Graph theory Mathematics Random graphs
188	Lower Bounds for (Weak) Sense of Direction Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:44 Connectivity Representation Graph Cayley graph Path decomposition Universal graph Graph theory Mathematics Matroid theory
189	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
190	Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2012-11-25 12:04:59 Submodular set function Order theory Matroid Linear programming Greedy algorithm XTR Monotonic function Greedoid Ordinal optimization Mathematics Mathematical analysis Matroid theory

UPDATE