Tight Lower Bounds on Graph Embedding Problems
نویسندگان
چکیده
منابع مشابه
Improved Lower Bounds for Graph Embedding Problems
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector Crafting, and show that these cannot be solved in time 2o(|s|/ log |s|), unless the Exponential Time Hypothesis fails. These results are used to obtain simplified hardness results for several ...
متن کاملTowards Tight Lower Bounds for Scheduling Problems
We show a close connection between structural hardness for k-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite structural hardness result of [1], we obtain a hardness of 2 − for the problem of minimising the makespan for scheduling precedence-constrained jobs with preemption o...
متن کاملTight Running Time Lower Bounds for Vertex Deletion Problems
The Π-Vertex Deletion problem has as input an undirected graph G = (V,E) and an integer k and asks whether there is a set of at most k vertices that can be deleted such that the resulting graph is a member of the graph class Π. By a classic result of Lewis and Yannakakis [J. Comput. Syst. Sci. ’80], Π-Vertex Deletion is NP-hard for all hereditary properties Π. We adapt the original NP-hardness ...
متن کاملTight Bounds for Graph Problems in Insertion Streams
Despite the large amount of work on solving graph problems in the data stream model, there do not exist tight space bounds for almost any of them, even in a stream with only edge insertions. For example, for testing connectivity, the upper bound is O(n logn) bits, while the lower bound is only Ω(n) bits. We remedy this situation by providing the first tight Ω(n logn) space lower bounds for rand...
متن کاملTight bounds for some problems
There are a number of fundamental problems in eomputational geometry for which work-optimal aJgorithDls exist which have a parallel running -fuDe of O(log n) in the PRAM model. These include problems like two and three dimensional convex-hulls, trapeSoidal decomposition, arrangement coDStruc:.tion, dommance among others. Further improvements in running time to sub-logarithmic range were not con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2017
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3051094