<--- Back to Details
First PageDocument Content
Mathematics / Combinatorial optimization / Greedoid / Order theory / Matroid / Submodular set function / KnuthBendix completion algorithm
Date: 2014-08-05 05:09:25
Mathematics
Combinatorial optimization
Greedoid
Order theory
Matroid
Submodular set function
KnuthBendix completion algorithm

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Download Document from Source Website

File Size: 122,03 KB

Share Document on Facebook

Similar Documents

K. Murota, University of Tokyo, Japan Matrices and Matroids for Systems Analysis A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction

DocID: 1vdBT - View Document

Special Colloquium Scaling Computer Vision in the Cloud Reza Zadeh Matroid and Stanford

DocID: 1uUMY - View Document

New Perspectives in Geometric Combinatorics MSRI Publications Volume 38, 1999 Matroid Bundles LAURA ANDERSON

DocID: 1uPzZ - View Document

ยจ BOIJ-SODERBERG EXPANSIONS OF MATROID STANLEY-REISNER RINGS ALEX FINK

DocID: 1uOKx - View Document

Matroid Bandits: Practical Large-Scale Combinatorial Bandits Branislav Kveton, Zheng Wen, Azin Ashkan, and Hoda Eydgahi Technicolor Labs Palo Alto, CA {branislav.kveton,zheng.wen,azin.ashkan,hoda.eydgahi}@technicolor.com

DocID: 1uDva - View Document