参数化问题的空间高效算法
Space Efficient Algorithms for Parameterised Problems
AI总结:
本文提出了一种空间高效的参数化算法,用于解决图问题中的k路径、最大叶子树和多切割问题,通过减少内存使用来应对大数据挑战。
摘要:
我们研究了具有有限内存的图问题的"空间高效"FPT算法。设n为输入图的大小,k为参数。我们提出了运行时间为f(k)*poly(n)且使用g(k)*polylog(n)工作空间的算法,其中f和g仅是k的函数,适用于k路径、最大叶子树和树中的多切割问题。这些算法受到大数据环境的启发,其中必须解决非常大的问题实例,而使用poly(n)内存是不可行的。它们也具有理论意义,因为大多数标准方法工具,如删除大量顶点或边,不可用,我们必须开发不同的方法来解决这些问题。
英文摘要:
We study "space efficient" FPT algorithms for graph problems with limited memory. Let n be the size of the input graph and k be the parameter. We present algorithms that run in time f(k)*poly(n) and use g(k)*polylog(n) working space, where f and g are functions of k alone, for k-Path, MaxLeaf SubTree and Multicut in Trees. These algorithms are motivated by big-data settings where very large problem instances must be solved, and using poly(n) memory is prohibitively expensive. They are also theoretically interesting, since most of the standard methods tools, such as deleting a large set of vertices or edges, are unavailable, and we must a develop different way to tackle them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。