14 research outputs found
Coloring Intersection Hypergraphs of Pseudo-Disks
We prove that the intersection hypergraph of a family of n pseudo-disks with respect to another family of pseudo-disks admits a proper coloring with 4 colors and a conflict-free coloring with O(log n) colors. Along the way we prove that the respective Delaunay-graph is planar. We also prove that the intersection hypergraph of a family of n regions with linear union complexity with respect to a family of pseudo-disks admits a proper coloring with constantly many colors and a conflict-free coloring with O(log n) colors. Our results serve as a common generalization and strengthening of many earlier results, including ones about proper and conflict-free coloring points with respect to pseudo-disks, coloring regions of linear union complexity with respect to points and coloring disks with respect to disks
Efficient Data Structures for Text Processing Applications
This thesis is devoted to designing and analyzing efficient text indexing data structures and associated algorithms for processing text data. The general problem is to preprocess a given text or a collection of texts into a space-efficient index to quickly answer various queries on this data. Basic queries such as counting/reporting a given pattern\u27s occurrences as substrings of the original text are useful in modeling critical bioinformatics applications. This line of research has witnessed many breakthroughs, such as the suffix trees, suffix arrays, FM-index, etc. In this work, we revisit the following problems: 1. The Heaviest Induced Ancestors problem 2. Range Longest Common Prefix problem 3. Range Shortest Unique Substrings problem 4. Non-Overlapping Indexing problem For the first problem, we present two new space-time trade-offs that improve the space, query time, or both of the existing solutions by roughly a logarithmic factor. For the second problem, our solution takes linear space, which improves the previous result by a logarithmic factor. The techniques developed are then extended to obtain an efficient solution for our third problem, which is newly formulated. Finally, we present a new framework that yields efficient solutions for the last problem in both cache-aware and cache-oblivious models
Approximation Techniques for Facility Location and Their Applications in Metric Embeddings
This thesis addresses the development of geometric approximation algorithms for huge
datasets and is subdivided into two parts. The first part deals with algorithms for facility
location problems, and the second part is concerned with the problem of computing
compact representations of finite metric spaces.
Facility location problems belong to the most studied problems in combinatorial optimization
and operations research. In the facility location variants considered in this thesis,
the input consists of a set of points where each point is a client as well as a potential
location for a facility. Each client has to be served by a facility. However, connecting a
client incurs connection costs, and opening or maintaining a facility causes so-called opening
costs. The goal is to open a subset of the input points as facilities such that the total
cost of the system is minimized