暂无分享,去创建一个
Pasin Manurangsi | Rajesh Hemant Chitnis | Andreas Emil Feldmann | R. Chitnis | Pasin Manurangsi | A. Feldmann
[1] Miroslav Chlebík,et al. Approximation Hardness of the Steiner Tree Problem on Graphs , 2002, SWAT.
[2] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[3] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[4] Michael Lampis,et al. Parameterized Approximation Schemes Using Graph Widths , 2013, ICALP.
[5] B. M. Waxman. New Approximation Algorithms for the Steiner Tree Problem , 1989 .
[6] Rolf Niedermeier,et al. Parameterized Complexity of Arc-Weighted Directed Steiner Problems , 2011, SIAM J. Discret. Math..
[7] Erik Jan van Leeuwen,et al. Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs , 2013, STACS.
[8] Sanjeev Khanna,et al. Design networks with bounded pairwise distance , 1999, STOC '99.
[9] Andreas Wiese. A ( 1 + )-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time ∗ , 2017 .
[10] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..
[11] Anupam Gupta,et al. Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA 2008.
[12] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.
[13] Jens Vygen. Faster algorithm for optimum Steiner trees , 2011, Inf. Process. Lett..
[14] Alex Zelikovsky,et al. An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.
[15] Fahad Panolan,et al. Complexity of the Steiner Network Problem with Respect to the Number of Terminals , 2019, STACS.
[16] Jon Feldman,et al. The Directed Steiner Network problem is tractable for a constant number of terminals , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[17] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[18] Jochen Könemann,et al. On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree , 2014, Math. Program..
[19] Rajesh Chitnis,et al. FPT Inapproximability of Directed Cut and Connectivity Problems , 2019, IPEC.
[20] K. Chao,et al. Steiner Minimal Trees , 2005 .
[21] Benny Applebaum,et al. Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[22] Krzysztof Pietrzak,et al. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems , 2003, J. Comput. Syst. Sci..
[23] Prasad Raghavendra,et al. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.
[24] Dániel Marx,et al. A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals , 2012, ICALP.
[25] Pasin Manurangsi,et al. Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH , 2018, Electron. Colloquium Comput. Complex..
[26] Ding-Zhu Du,et al. The k-Steiner Ratio in Graphs , 1997, SIAM J. Comput..
[27] Wen-Tsuen Chen,et al. The strongly connecting problem on multihop packet radio networks , 1989, IEEE Trans. Commun..
[28] Luca Trevisan,et al. From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[29] Andreas Björklund,et al. Fourier meets möbius: fast subset convolution , 2006, STOC '07.
[30] Adrian Vetta,et al. Approximating the minimum strongly connected subgraph via a matching lower bound , 2001, SODA '01.
[31] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[32] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[33] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[34] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[35] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[36] Stefan Richter,et al. A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.
[37] Shi Li,et al. O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm , 2018, STOC.
[38] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[39] Erik Jan van Leeuwen,et al. Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[40] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[41] Vangelis Th. Paschos,et al. On Subexponential and FPT-Time Inapproximability , 2013, Algorithmica.
[42] Dániel Marx,et al. Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..
[43] Dušan Knop,et al. Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices , 2018, STACS.
[44] Mohammad Taghi Hajiaghayi,et al. Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth , 2009, JACM.
[45] Jesper Nederlof. Fast Polynomial-Space Algorithms Using Inclusion-Exclusion , 2012, Algorithmica.
[46] Ali Ridha Mahjoub,et al. Design of Survivable Networks: A survey , 2005, Networks.
[47] Fahad Panolan,et al. Lossy kernelization , 2016, STOC.
[48] Fabrizio Grandoni,et al. Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.
[49] Mohammad Taghi Hajiaghayi,et al. Fixed-Parameter and Approximation Algorithms: A New Look , 2013, IPEC.
[50] Michal Pilipczuk,et al. On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[51] R. Krithika,et al. Lossy Kernels for Graph Contraction Problems , 2016, FSTTCS.
[52] Xinhui Wang,et al. Dynamic Programming for Minimum Steiner Trees , 2007, Theory of Computing Systems.
[53] Dániel Marx,et al. On the Optimality of Planar and Geometric Approximation Schemes , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[54] Guy Kortsarz,et al. On Choosing a Dense Subgraph (Extended Abstract) , 1993, FOCS 1993.
[55] Hans Jürgen Prömel,et al. A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 , 2000, J. Algorithms.
[56] Panos M. Pardalos,et al. Design of survivable networks , 2006 .
[57] Q. Feng,et al. On better heuristic for Euclidean Steiner minimum trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[58] Saket Saurabh,et al. Kernelization Lower Bounds Through Colors and IDs , 2014, ACM Trans. Algorithms.
[59] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[60] Guy Kortsarz,et al. Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.
[61] Saket Saurabh,et al. Subexponential Parameterized Odd Cycle Transversal on Planar Graphs , 2012, FSTTCS.
[62] Saket Saurabh,et al. Parameterized Complexity and Approximability of Directed Odd Cycle Transversal , 2017, SODA.
[63] ChitnisRajesh,et al. Parameterized Approximation Algorithms for Bidirected Steiner Network Problems , 2021 .
[64] David Eisenstat,et al. An efficient polynomial-time approximation scheme for Steiner forest in planar graphs , 2012, SODA.
[65] Michal Pilipczuk,et al. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[66] Robert Krauthgamer,et al. Polylogarithmic inapproximability , 2003, STOC '03.
[67] Min Kyung An,et al. Dual power assignment optimization and fault tolerance in WSNs , 2015, J. Comb. Optim..
[68] Michal Pilipczuk,et al. Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams , 2015, ESA.
[69] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[70] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[71] Fahad Panolan,et al. Lossy Kernels for Connected Dominating Set on Sparse Graphs , 2017, STACS.
[72] Piotr Berman,et al. Approximation algorithms for spanner problems and Directed Steiner Forest , 2013, Inf. Comput..
[73] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[74] Marek Karpinski,et al. New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..
[75] Chen Wang,et al. On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity , 2008, Theor. Comput. Sci..
[76] Philip N. Klein,et al. A subexponential parameterized algorithm for Subset TSP on planar graphs , 2014, SODA.
[77] Jacques Stern,et al. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..
[78] Piotr Sankowski,et al. Improved algorithms for min cut and max flow in undirected planar graphs , 2011, STOC '11.
[79] Amit Kumar,et al. Tight FPT Approximations for $k$-Median and k-Means , 2019, ICALP.
[80] Sebastian Siebertz. Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes , 2017, ArXiv.
[81] Ram Ramanathan,et al. Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[82] Dániel Marx,et al. The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems , 2017, ICALP.
[83] Pasin Manurangsi,et al. ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network , 2018, ITCS.
[84] Mohammad Taghi Hajiaghayi,et al. Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) , 2014, SODA.
[85] P. Klein,et al. Solving PLANAR k-TERMINAL CUT in O(nc , 2012 .
[86] Yijia Chen,et al. The Constant Inapproximability of the Parameterized Dominating Set Problem , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[87] Pasin Manurangsi,et al. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.
[88] Andreas Emil Feldmann,et al. Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs , 2015, Algorithmica.
[89] Irit Dinur,et al. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..
[90] Alex Zelikovsky,et al. Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..
[91] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[92] David G. Horobin. Can You Beat That , 1999 .