Skip to main content
Conference Proceedings

Effect of corner information in simultaneous placement of K rectangles and tableaux

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6196 LNCS 235-243
DOI: 10.1007/978-3-642-14031-0_27
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n ×n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Anzai, S., Chun, J., Kasai, R., Korman, M., & Tokuyama, T. (2010). Effect of corner information in simultaneous placement of K rectangles and tableaux. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6196 LNCS, pp. 235–243). https://doi.org/10.1007/978-3-642-14031-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free