Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings > Guess Free Maximization of Submodular and Linear Sums
Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings |
Zachary Friggstad; Jörg-Rüdiger Sack; Mohammad R Salavatipour
Springer International Publishing
Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings
Guess Free Maximization of Submodular and Linear Sums
Authors

Moran Feldman

ARI Id

1665205248525_5355603

Access

Not Available Free

Pages

380-394

DOI

10.1007/978-3-030-24766-9_28

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-030-24766-9_28

Table of Contents of Book
Showing 1 to 20 of 44 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
i-xx
Succinct Data Structures for Families of Interval Graphs
Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti
1-13
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
Kateřina Altmanová; Petr Kolman; Jan Voborník
14-27
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Boris Aronov; Omrit Filtser; Michael Horton; Matthew J. Katz; Khadijeh Sheikhan
28-42
Positive-Instance Driven Dynamic Programming for Graph Searching
Max Bannach; Sebastian Berndt
43-56
How to Morph a Tree on a Small Grid
Fidel Barrera-Cruz; Manuel Borrazzo; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani et al.
57-70
Approximating Robust Bin Packing with Budgeted Uncertainty
Aniket Basu Roy; Marin Bougeret; Noam Goldberg; Michael Poss
71-84
Rank-Select Indices Without Tears
Tim Baumann; Torben Hagerup
85-98
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
Amariah Becker; Philip N. Klein; Aaron Schild
99-111
A Framework for Vehicle Routing Approximation Schemes in Trees
Amariah Becker; Alice Paul
112-125
Avoidable Vertices and Edges in Graphs
Jesse Beisegel; Maria Chudnovsky; Vladimir Gurvich; Martin Milanič; Mary Servatius
126-139
Plane Hop Spanners for Unit Disk Graphs
Ahmad Biniaz
140-154
On the Minimum Consistent Subset Problem
Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi et al.
155-167
Parameterized Complexity of Conflict-Free Graph Coloring
Hans L. Bodlaender; Sudeshna Kolay; Astrid Pieterse
168-180
Graph Isomorphism for \((H_1, H_2)\) -Free Graphs: An Almost Complete Dichotomy
Marthe Bonamy; Konrad K. Dabrowski; Matthew Johnson; Daniël Paulusma
181-195
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs
Prosenjit Bose; Pilar Cano; Maria Saumell; Rodrigo I. Silveira
196-210
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
Prosenjit Bose; Paz Carmi; Mark J. Keil; Anil Maheshwari; Saeed Mehrabi; Debajyoti Mondal et al.
211-224
Online Bin Covering with Advice
Joan Boyar; Lene M. Favrholdt; Shahin Kamali; Kim S. Larsen
225-238
Stackelberg Packing Games
Toni Böhnlein; Oliver Schaudt; Joachim Schauer
239-253
FRESH: Fréchet Similarity with Hashing
Matteo Ceccarello; Anne Driemel; Francesco Silvestri
254-268
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 44 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings