Tìm kiếm theo: Tác giả Trung Thanh. Nguyen

Duyệt theo: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Hoặc nhập chữ cái đầu tiên:  
Kết quả [1 - 1] / 1
  • Tác giả : Trung Thanh. Nguyen; Khaled Elbassioni;  Người hướng dẫn: -;  Đồng tác giả: - (2021)

    Binary non-linear programs belong to the class of  which are computationally hard even to approximate. This paper aims to explore some conditions on the problem structure, under which the resulting problem can be well approximated. Particularly, we consider a setting when both objective function and constraint are low-rank functions, which depend only on a few  of the input variables, and provide  approximation schemes. Our result generalizes and unifies some existing results in the literature.