Search Results - "Avis, David"

On the foundations and extremal structure of the holographic entropy cone by Avis, David, Hernández-Cuenca, Sergio

“…The holographic entropy cone (HEC) is a polyhedral cone first introduced in the study of a class of quantum entropy inequalities. It admits a graph-theoretic…”
Get full text

On the extension complexity of combinatorial polytopes by Avis, David, Tiwary, Hans Raj

“…In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting…”
Get full text

An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees by Avis, David, Devroye, Luc

“…Recently Avis and Jordan have demonstrated the efficiency of a simple technique called budgeting for the parallelization of a number of tree search algorithms…”
Get full text

Automated 3-D Extraction of Inner and Outer Surfaces of Cerebral Cortex from MRI by MacDonald, David, Kabani, Noor, Avis, David, Evans, Alan C.

“…Automatic computer processing of large multidimensional images such as those produced by magnetic resonance imaging (MRI) is greatly aided by deformable…”
Get full text

Enumeration of Nash equilibria for two-player games by Avis, David, Rosenberg, Gabriel D, Savani, Rahul, von Stengel, Bernhard

“…This paper describes algorithms for finding all Nash equilibria of a two-player game in strategic form. We present two algorithms that extend earlier work. Our…”
Get full text

mplrs: A scalable parallel vertex/facet enumeration code by Avis, David, Jordan, Charles

Get full text

On the H-free extension complexity of the TSP by Avis, David, Tiwary, Hans Raj

“…It is known that the extension complexity of the TSP polytope for the complete graph K n is exponential in n even if the subtour inequalities are excluded. In…”
Get full text

On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes by Aoshima, Yoshikazu, Avis, David, Deering, Theresa, Matsumoto, Yoshitake, Moriyama, Sonoko

“…An acyclic USO on a hypercube is formed by directing its edges in such a way that the digraph is acyclic and each face of the hypercube has a unique sink and a…”
Get full text

Generating facets for the cut polytope of a graph by triangular elimination by Avis, David, Imai, Hiroshi, Ito, Tsuyoshi

“…The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for…”
Get full text

An exponential lower bound for Cunningham’s rule by Avis, David, Friedmann, Oliver

“…In this paper we give an exponential lower bound for Cunningham’s least recently considered (round-robin) rule as applied to parity games, Markov decision…”
Get full text

Sparktope: linear programs from algorithms by Avis, David, Bremner, David

“…In a recent paper, Avis, Bremner, Tiwary and Watanabe gave a method for constructing linear programs (LPs) based on algorithms written in a simple programming…”
Get full text

mts: a light framework for parallelizing tree search codes by Avis, David, Jordan, Charles

“…We describe mts , a generic framework for parallelizing certain types of tree search programmes including reverse search, backtracking, branch and bound and…”
Get full text

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra by Avis, David, Fukuda, Komei

Get full text

mplrs: A scalable parallel vertex/facet enumeration code by Avis, David, Jordan, Charles

“…We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of…”
Get full text

On Reconfiguration Graphs of Independent Sets Under Token Sliding by Avis, David, Hoang, Duc A.

“…An independent set of a graph G is a vertex subset I such that there is no edge joining any two vertices in I . Imagine that a token is placed on each vertex…”
Get full text

Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding by Avis, David, Hoang, Duc A.

Get full text

On the directed cut cone and polytope by Avis, David, Meagher, Conor

“…In this paper we study the directed cut cone and polytope which are the positive hull and convex hull of all directed cut vectors of a complete directed graph,…”
Get full text

A generalization of extension complexity that captures P by Avis, David, Tiwary, Hans Raj

“…•We study a generalization of extended formulations of polytopes.•Our generalization allows ignoring a subset of valid inequalities.•Our generalization…”
Get full text

Algorithmic enumeration of surrounding polygons by Yamanaka, Katsuhisa, Avis, David, Horiyama, Takashi, Okamoto, Yoshio, Uehara, Ryuhei, Yamauchi, Tanami

“…We are given a set S of points in the Euclidean plane. We assume that S is in general position. A simple polygon P is a surrounding polygon of S if each vertex…”
Get full text

HV-symmetric polyhedra and bipolarity by Avis, David

“…Every polyhedron P in R^n can be described by an H-representation \mathcal{H}(P) consisting of half spaces or equivalently by a V-representation \mathcal{V}(P)…”
Get full text