Lee, Euiwoong Partitioning a graph into small pieces with applications to path transversal. (English) Zbl 1452.68137 Math. Program. 177, No. 1-2 (A), 1-19 (2019). MSC: 68R10 05C40 05C70 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{E. Lee}, Math. Program. 177, No. 1--2 (A), 1--19 (2019; Zbl 1452.68137) Full Text: DOI arXiv
Hosoda, Jun; Hromkovič, Juraj; Izumi, Taisuke; Ono, Hirotaka; Steinová, Monika; Wada, Koichi On the approximability and hardness of minimum topic connected overlay and its special instances. (English) Zbl 1238.68063 Theor. Comput. Sci. 429, 144-154 (2012); corrigendum ibid. 562, 660-661 (2015). MSC: 68Q17 68W25 68R10 68M10 PDFBibTeX XMLCite \textit{J. Hosoda} et al., Theor. Comput. Sci. 429, 144--154 (2012; Zbl 1238.68063) Full Text: DOI
Fernau, Henning A top-down approach to search-trees: Improved algorithmics for 3-hitting set. (English) Zbl 1184.68598 Algorithmica 57, No. 1, 97-118 (2010). MSC: 68W05 68P10 PDFBibTeX XMLCite \textit{H. Fernau}, Algorithmica 57, No. 1, 97--118 (2010; Zbl 1184.68598) Full Text: DOI
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. (English) Zbl 1214.05162 J. Discrete Algorithms 8, No. 1, 36-49 (2010). MSC: 05C85 05C70 05C10 68W25 PDFBibTeX XMLCite \textit{B. Escoffier} et al., J. Discrete Algorithms 8, No. 1, 36--49 (2010; Zbl 1214.05162) Full Text: DOI
Călinescu, Gruia; Chekuri, Chandra; Vondrák, Jan Disjoint bases in a polymatroid. (English) Zbl 1205.05039 Random Struct. Algorithms 35, No. 4, 418-430 (2009). MSC: 05B35 PDFBibTeX XMLCite \textit{G. Călinescu} et al., Random Struct. Algorithms 35, No. 4, 418--430 (2009; Zbl 1205.05039) Full Text: DOI
Angel, Eric; Bampis, Evripidis; Gourvès, Laurent On the minimum hitting set of bundles problem. (English) Zbl 1175.68557 Theor. Comput. Sci. 410, No. 45, 4534-4542 (2009). Reviewer: Václav Koubek (Praha) MSC: 68W25 68Q17 90C59 PDFBibTeX XMLCite \textit{E. Angel} et al., Theor. Comput. Sci. 410, No. 45, 4534--4542 (2009; Zbl 1175.68557) Full Text: DOI Link
Engebretsen, Lars; Holmerin, Jonas More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. (English) Zbl 1159.68033 Random Struct. Algorithms 33, No. 4, 497-514 (2008). MSC: 68T15 68Q15 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. Engebretsen} and \textit{J. Holmerin}, Random Struct. Algorithms 33, No. 4, 497--514 (2008; Zbl 1159.68033) Full Text: DOI
Chlebík, M.; Chlebíková, J. Approximation hardness of dominating set problems in bounded degree graphs. (English) Zbl 1169.68037 Inf. Comput. 206, No. 11, 1264-1275 (2008). MSC: 68R10 05C69 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Chlebík} and \textit{J. Chlebíková}, Inf. Comput. 206, No. 11, 1264--1275 (2008; Zbl 1169.68037) Full Text: DOI Link
Mastrolilli, Monaldo; Mutsanas, Nikolaus; Svensson, Ola Approximating single machine scheduling with scenarios. (English) Zbl 1159.68671 Goel, Ashish (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008, Boston, MA, USA, August 25–27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85362-6/pbk). Lecture Notes in Computer Science 5171, 153-164 (2008). MSC: 68W25 68Q17 90B35 90C27 PDFBibTeX XMLCite \textit{M. Mastrolilli} et al., Lect. Notes Comput. Sci. 5171, 153--164 (2008; Zbl 1159.68671) Full Text: DOI
Angel, Eric; Bampis, Evripidis; Gourvès, Laurent On the minimum hitting set of bundles problem. (English) Zbl 1143.90372 Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 3-14 (2008). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{E. Angel} et al., Lect. Notes Comput. Sci. 5034, 3--14 (2008; Zbl 1143.90372) Full Text: DOI Link
Bordewich, Magnus; Dyer, Martin; Karpinski, Marek Path coupling using stopping times and counting independent sets and colorings in hypergraphs. (English) Zbl 1181.05061 Random Struct. Algorithms 32, No. 3, 375-399 (2008). MSC: 05C65 05C69 05C30 05C15 68W20 68Q25 60C05 60J05 PDFBibTeX XMLCite \textit{M. Bordewich} et al., Random Struct. Algorithms 32, No. 3, 375--399 (2008; Zbl 1181.05061) Full Text: DOI arXiv
Escoffier, Bruno; Hammer, Peter L. Approximation of the quadratic set covering problem. (English) Zbl 1157.90484 Discrete Optim. 4, No. 3-4, 378-386 (2007). MSC: 90C09 PDFBibTeX XMLCite \textit{B. Escoffier} and \textit{P. L. Hammer}, Discrete Optim. 4, No. 3--4, 378--386 (2007; Zbl 1157.90484) Full Text: DOI HAL
Engebretsen, Lars; Guruswami, Venkatesan Is constraint satisfaction over two variables always easy? (English) Zbl 1077.68094 Random Struct. Algorithms 25, No. 2, 150-178 (2004). MSC: 68T20 68Q17 68Q25 68W25 PDFBibTeX XMLCite \textit{L. Engebretsen} and \textit{V. Guruswami}, Random Struct. Algorithms 25, No. 2, 150--178 (2004; Zbl 1077.68094) Full Text: DOI