Results 191 to 200 of about 22,632 (241)
Some of the next articles are maybe not open access.
Linear Matroid Intersection is in Quasi-NC
Computational Complexity, 2017Given two matroids on the same ground set, the matroid intersection problem asks to find a common independent set of maximum size. In case of linear matroids, the problem had a randomized parallel algorithm but no deterministic one.
R. Gurjar, T. Thierauf
semanticscholar +1 more source
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint
International Colloquium on Automata, Languages and Programming, 2018We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important matroids.
Alina Ene, Huy L. Nguyen
semanticscholar +1 more source
Approximate multi-matroid intersection via iterative refinement
Mathematical programming, 2018We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the constraints of the other matroids.
André Linhares +3 more
semanticscholar +1 more source
SIAM Journal on Discrete Mathematics, 1991
Summary: This paper begins with a short discussion of the general principles of Rigidity Theory. The main interest is the combinatorial part of this subject: generic rigidity. While generic rigidity has several combinatorial characterizations in dimensions one and two, these characterizations have not been able to be extended to characterizations of ...
openaire +1 more source
Summary: This paper begins with a short discussion of the general principles of Rigidity Theory. The main interest is the combinatorial part of this subject: generic rigidity. While generic rigidity has several combinatorial characterizations in dimensions one and two, these characterizations have not been able to be extended to characterizations of ...
openaire +1 more source
2001
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.
openaire +2 more sources
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.
openaire +2 more sources
Journal of Mathematical Sciences, 2002
This review is devoted to the description of the main results of the theory of matroids. Translated from Russian and likely to have been written in the mid 1990s, the review begins with equivalent axiomatizations of matroids (including a table relating these axiomatizations), examples of matroids, and matroid constructions.
openaire +2 more sources
This review is devoted to the description of the main results of the theory of matroids. Translated from Russian and likely to have been written in the mid 1990s, the review begins with equivalent axiomatizations of matroids (including a table relating these axiomatizations), examples of matroids, and matroid constructions.
openaire +2 more sources
Equicardinal Matroids And Matroid Designs.
1970PhD ; Mathematics ; University of Michigan, Horace H. Rackham School of Graduate Studies ; http://deepblue.lib.umich.edu/bitstream/2027.42/186559/2/7115351 ...
openaire +2 more sources
1997
Abstract A matroid consists of a collection of subsets of a finite set which, loosely speaking, behave like the edge sets of cycles in a graph. Matroids also arise naturally from matrices and projective geometries. This chapter provides some examples, mainly in the context of connectivity, of how the interplay between graphs and matroids
openaire +1 more source
Abstract A matroid consists of a collection of subsets of a finite set which, loosely speaking, behave like the edge sets of cycles in a graph. Matroids also arise naturally from matrices and projective geometries. This chapter provides some examples, mainly in the context of connectivity, of how the interplay between graphs and matroids
openaire +1 more source
2001
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.
openaire +2 more sources
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s they have had increasing interest and the theoretical results obtained have been used for solving several difficult problems in various fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.
openaire +2 more sources