Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Authors:	Leonid Khachiyan Endre Boros Khaled Elbassioni Vladimir Gurvich Kazuhisa Makino

Affiliation:	1. Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ 08854-8003, United States;2. RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003, United States;3. Max-Planck-Institut für Informatik, Saarbrücken, Germany;4. Department of Mathematical Informatics, Graduate School of Information and Technology, University of Tokyo, Tokyo, 113-8656, Japan

Abstract:

Keywords:	Incremental generation Maximal empty boxes p $p$ -efficient points" target="_blank">gif" overflow="scroll">p-efficient points
本文献已被 ScienceDirect 等数据库收录！