Imre Bárány, Shmuel Onn  Home/Search
Context
Related
| iew3.technion.ac.il:8080/~...MOR1.ps.gz iew3.technion.ac.il:8080/~...MOR1.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iew3.technion.a...edpublications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the following Colourful generalization of Linear Programming: given sets of points S 1 ; \Delta \Delta \Delta ; S k ae IR d , referred to as colours, and a point b 2 IR d , decide whether there is a colourful T = fs 1 ; : : : ; s k g such that b 2 conv(T ), and if there is one, find it. Linear Programming is obtained by taking k = d + 1 and S 1 = : : : = S d+1 . If k = d + 1 and b 2 T d+1 i=1 conv(S i ) then a solution always exists: we describe an efficient iterative... (Update)
Active bibliography (related documents): More All
0.3: Proof of the Alon-Tarsi Conjecture for n = 2^r p - Drisko (1998) (Correct)
0.3: Condition Number Complexity of an Elementary Algorithm for.. - Epelman, Freund (1997) (Correct)
0.3: Condition Number Complexity of an Elementary Algorithm for.. - Epelman, Freund (1998) (Correct)
Similar documents based on text: More All
0.3: A Colorful Determinantal Identity, a Conjecture of Rota.. - Shmuel Onn Department (Correct)
0.2: On the Geometry and Computational Complexity of Radon Partitions in .. - Onn (1991) (Correct)
0.2: Geometry, Complexity, and Combinatorics of Permutation Polytopes - Onn (1993) (Correct)
BibTeX entry: (Update)
@misc{ ny-colourful,
author = "Imre Bárány and Shmuel Onn",
title = "Colourful Linear Programming and its Relatives",
url = "citeseer.ist.psu.edu/117695.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
572 Computers and Intractability (context) - Garey, Johnson - 1979
251 The complexity of computing the permanent (context) - Valiant - 1979
213 a theory of computation and complexity over the real numbers (context) - Blum, Shub et al. - 1989
18 A generalization of Radon's theorem (context) - Tverberg - 1966
6 Point selections and weak ffl--nets for convex hulls (context) - Alon, B'ar'any et al. - 1992
6 Signable posets and partitionable simplicial complexes - Kleinschmidt, Onn - 1996
5 Tverberg's theorem via number fields (context) - Sarkaria - 1992
4 Personal communication (context) - Freund - 1995
3 An ffl-precise feasible solution to a linear program in ffl .. (context) - Dantzig - 1992
3 A colorful determinantal identity (context) - Onn - 1997
1 Weak ffl--nets for convex sets (context) - Chazelle, Edelsbrunner et al. - 1995
1 A generalization of Carath'eodory's theorem (context) - Math, B'ar'any - 1982
1 Piercing convex sets and the Hadwiger--Debrunner (context) - Prob, -- et al. - 1992
1 the geometry and computational complexity of Radon partition.. (context) - Geom, Onn et al. - 1991
Documents on the same site (http://iew3.technion.ac.il:8080/~onn/Home-Page/selected-publications.html): More
Determination of Social Laws for Multi-Agent Mobilization - Onn, Tennenholtz (1997) (Correct)
Representations and Characterizations of Vertices of.. - Hwang, Onn, Rothblum (1998) (Correct)
Separable Partitions - Alon, Onn (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC