Concept

Absolutely convex set

Related publications (74)

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results

We present an O(p*n) algorithm for the problem of finding disjoint simple paths of minimum total length between p given pairs of terminals on oriented partial 2-trees with n nodes and positive or negative arc lengths. The algorithm is in O(n) if all termin ...

1995

Tree polytope on 2-trees

Thomas Liebling, François Margot

We give a complete polyhedral characterization of the tree polytope (convex hull of the characteristic vectors of trees in the graph) on 2-trees. ...

1994

Steiner trees with n terminals among n + 1 nodes

Let G=(V,E) be connected undirected graph and N a subset of distinguished nodes, called terminals. A Steiner tree on [G,N] is a minimal tree connecting all the terminal nodes. Restricting the instances to the case /N/=/N/-1, we present an algorithm to cons ...

1992

On the number of iterations of the simplex method.

Thomas Liebling

RENYI and SULANKE studied the properties of the convex hull of a set of points thrown at random independently of each other. Carnal generalized their results concerning the asymptotic behaviour of the number of faces of that convex hull as the number of po ...

Verlag Anton Hain1972

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.