The computational complexity of densest region detection

Journal of Computer and System Sciences

Volumn 64, Issue 1, 2002, Pages 22-47

  Ben David, Shai ^a   Eiron, Nadav ^a   Simon, Hans Ulrich ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

GEOMETRIC PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0036477260     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1797     Document Type: Article

References (12)

1. On the difficulty of approximately maximizing agreements
2. Learning distributions by their density levels - A paradigm for learning without a teacher
3. Efficient learning of linear perceptrons
4. q into a Banach space of type p with some applications to eigenvalue problems
5. Universal Donsker classes and metric entropy
6. Some optimal inapproximability results
7. The densest hemisphere problem
8. On the complexity of polyhedral separability
9. Remarques sur un résultat non publié de B. Maurey