AN EXTREMAL PROBLEM ON SPARSE 0-1 MATRICES

被引:30
|
作者
BIENSTOCK, D
GYORI, E
机构
[1] BELLCORE,MORRISTOWN,NJ 07960
[2] HUNGARIAN ACAD SCI,INST MATH,H-1361 BUDAPEST 5,HUNGARY
关键词
EXTREMAL PROBLEMS;
D O I
10.1137/0404002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The problem of estimating the number of 1's in a square 0-1 matrix with certain forbidden configurations is considered, and nearly tight bounds are provided. This is motivated by a problem in computational geometry.
引用
收藏
页码:17 / 27
页数:11
相关论文
共 50 条
  • [31] EXACT BOUNDS FOR (λ, n)-STABLE 0-1 MATRICES
    Bruen, Trevor C.
    TRANSACTIONS ON COMBINATORICS, 2020, 9 (03) : 171 - 180
  • [32] DOUBLY LEXICAL ORDERING OF DENSE 0-1 MATRICES
    SPINRAD, JP
    INFORMATION PROCESSING LETTERS, 1993, 45 (05) : 229 - 235
  • [34] On the minimal number of even submatrices of 0-1 matrices
    Pinelis, I
    CODES, DESIGNS AND GEOMETRY, 1996, : 81 - 89
  • [35] Heuristics for the 0-1 multidimensional knapsack problem
    Boyer, V.
    Elkihel, M.
    El Baz, D.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (03) : 658 - 664
  • [36] Clustering Problem with 0-1 Quadratic Programming
    Haddouch, Khalid
    El Allaoui, Ahmad
    Messaoudi, Abdelhafid
    El Moutaouakil, Karim
    Dadi, El Wardani
    PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION & COMMUNICATION TECHNOLOGIES 2015 (MEDCT 2015), VOL 2, 2016, 381 : 111 - 120
  • [37] A minimal algorithm for the 0-1 Knapsack Problem
    Pisinger, D
    OPERATIONS RESEARCH, 1997, 45 (05) : 758 - 767
  • [38] EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    NAUSS, RM
    MANAGEMENT SCIENCE, 1976, 23 (01) : 27 - 31
  • [39] An Efficient Procedure for 0-1 IP Problem
    Machac, Otakar
    Bohmova, Simona
    PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2005, 2005, : 238 - 243
  • [40] The multidimensional 0-1 knapsack problem:: An overview
    Fréville, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (01) : 1 - 21