Results 1  10
of
436
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Visibility Graphs and Oriented Matroids
, 2002
"... We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank 3 oriented matroid can be constructed in polynomial time, which if affinely coordinatizable yields a simple polygon whos ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank 3 oriented matroid can be constructed in polynomial time, which if affinely coordinatizable yields a simple polygon
Exponentially Dense Matroids
, 2011
"... This thesis deals with questions relating to the maximum density of rankn matroids in a minorclosed class. Consider a minorclosed class M of matroids that does not contain a given rank2 uniform matroid. The growth rate function is defined by hM(n) = max (M  : M ∈M simple, r(M) ≤ n). The Gro ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
This thesis deals with questions relating to the maximum density of rankn matroids in a minorclosed class. Consider a minorclosed class M of matroids that does not contain a given rank2 uniform matroid. The growth rate function is defined by hM(n) = max (M  : M ∈M simple, r(M) ≤ n
REDUCING THE RANK OF A MATROID
"... Abstract. We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the minimum kcut problem, which admits a 2approximation al ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the minimum kcut problem, which admits a 2approximation
Infinite Matroids and Determinacy of Games
, 2013
"... Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the WellquasiorderingConjecture to infinite matroids and to show that the class of planar infinite matroids does not have a univer ..."
Abstract
 Add to MetaCart
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the WellquasiorderingConjecture to infinite matroids and to show that the class of planar infinite matroids does not have a
Algorithms for enumerating circuits in matroids
 in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), LNCS 2906
, 2003
"... Abstract. We present an incremental polynomialtime algorithm for enumerating all circuits of a matroid or, more generally, all minimal spanning sets for a flat. This result implies, in particular, that for a given infeasible system of linear equations, all its maximal feasible subsystems, as well ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We present an incremental polynomialtime algorithm for enumerating all circuits of a matroid or, more generally, all minimal spanning sets for a flat. This result implies, in particular, that for a given infeasible system of linear equations, all its maximal feasible subsystems, as well
The τvalue for games on matroids
"... In the classical model of games with transferable utility one assumes that each subgroup of players can form and cooperate to obtain its value. However, we can think that in some situations this assumption is not realistic, that is, not all coalitions are feasible. This suggests that it is necessary ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that it is necessary to raise the whole question of generalizing the concept of transferable utility game, and therefore to introduce new solution concepts. In this paper we define games on matroids and extend the τvalue as a compromise value for these games.
Results 1  10
of
436