Improved Submatrix Maximum Queries in Monge Matrices

Paweł Gawrychowski, Shay Mozes, Oren Weimann

Type: Book-Chapter

Publication Date: 2014-01-01

Citations: 4

DOI: https://doi.org/10.1007/978-3-662-43948-7_44

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Improved Submatrix Maximum Queries in Monge Matrices	2013	Paweł Gawrychowski Shay Mozes Oren Weimann
+	Improved Submatrix Maximum Queries in Monge Matrices	2013	Paweł Gawrychowski Shay Mozes Oren Weimann
+	Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search	2015	Paweł Gawrychowski Shay Mozes Oren Weimann
+	Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search	2015	Paweł Gawrychowski Shay Mozes Oren Weimann
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir
+ PDF Chat	Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search	2015	Paweł Gawrychowski Shay Mozes Oren Weimann
+	On Updating and Querying Submatrices	2020	Jason Yang Jun Wan
+ PDF Chat	Parallel Searching in Generalized Monge Arrays	1997	Alok Aggarwal D. Kravets Jong-Kyu Park Subhankar Sen
+ PDF Chat	Fast Matrix Multiplication meets the Subdmodular Width	2024	Mahmoud Abo Khamis Xiao Hu Dan Suciu
+	Submodular function minimization in and searching in Monge arrays	2004	Maurice Queyranne
+	Multiplication Algorithms for Monge Matrices	2010	Rua Alves Redol
+ PDF Chat	Submodular Maximization in Exactly $n$ Queries	2024	Eric Balkanski Steven DiSilvio Alan Kuhnle
+ PDF Chat	Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix	2011	Ali Çivril Malik Magdon‐Ismail
+	A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.	2021	Ariel Kulik Roy Schwartz Hadas Shachnai
+	On the recognition of permuted bottleneck monge matrices	1993	Bettina Klinz Rüdiger Rudolf Gerhard J. Woeginger
+	Superlinear bounds on matrix searching	1990	Maria Klawe
+	Bridging Dense and Sparse Maximum Inner Product Search	2023	Sebastian Bruch Franco Maria Nardini Amir Ingber Edo Liberty
+ PDF Chat	Bridging Dense and Sparse Maximum Inner Product Search	2024	Sebastian Bruch Franco Maria Nardini Amir Ingber Edo Liberty
+	Planar Emulators for Monge Matrices.	2020	Hsien-Chih Chang Tim Ophelders

Works That Cite This (3)

Action	Title	Year	Authors
+ PDF Chat	Improved Submatrix Maximum Queries in Monge Matrices	2014	Paweł Gawrychowski Shay Mozes Oren Weimann
+	Faster shortest paths in dense distance graphs, with applications	2017	Shay Mozes Yahav Nussbaum Oren Weimann
+ PDF Chat	Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search	2015	Paweł Gawrychowski Shay Mozes Oren Weimann

Works Cited by This (11)

Action	Title	Year	Authors
+	ON SIMPLE LINEAR PROGRAMMING PROBLEMS	2003	Alan J. Hoffman
+ PDF Chat	Improved Submatrix Maximum Queries in Monge Matrices	2014	Paweł Gawrychowski Shay Mozes Oren Weimann
+	Fast distance multiplication of unit-Monge matrices	2010	Alexander Tiskin
+	Geometric applications of a matrix-searching algorithm	1987	Alok Aggarwal Maria Klawe Shlomo Moran Peter W. Shor Robert Wilber
+	Perspectives of Monge properties in optimization	1996	Rainer E. Burkard Bettina Klinz Rüdiger Rudolf
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir
+	On simple linear programming problems	1963	A. J. Hoffman
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir
+ PDF Chat	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2011	Glencora Borradaile Philip N. Klein Shay Mozes Yahav Nussbaum Christian Wulff‐Nilsen
+ PDF Chat	Orthogonal range searching on the RAM, revisited	2011	Timothy M. Chan Kasper Green Larsen Mihai Pătraşcu