×

Found 40 Documents (Results 1–40)

Max-SAT with cardinality constraint parameterized by the number of clauses. (English) Zbl 07857873

Soto, José A. (ed.) et al., Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18–22, 2024. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 14579, 223-237 (2024).
MSC:  68Qxx 68Rxx 68Wxx
Full Text: DOI

Parameterized algorithms for finding highly connected solution. (English) Zbl 07615727

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 1-16 (2022).
MSC:  68Qxx
Full Text: DOI

Algorithms and complexity results for the capacitated vertex cover problem. (English) Zbl 1445.68178

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 473-489 (2019).
Full Text: DOI

What is known about vertex cover kernelization? (English) Zbl 1514.68213

Böckenhauer, Hans-Joachim (ed.) et al., Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11011, 330-356 (2018).
MSC:  68R10 05C70 68Q27

Approximating connectivity domination in weighted bounded-genus graphs. (English) Zbl 1376.68171

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 584-597 (2016).
Full Text: DOI

Improved approximations for hard optimization problems via problem instance classification. (English) Zbl 1327.68333

Calude, Cristian S. (ed.) et al., Rainbow of computer science. Dedicated to Hermann Maurer on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-19390-3/pbk). Lecture Notes in Computer Science 6570, 3-19 (2011).
MSC:  68W25 68Q17 68Q25

Parameterized complexity for domination problems on degenerate graphs. (English) Zbl 1202.68278

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 195-205 (2008).
MSC:  68R10 05C69 68Q25
Full Text: DOI

Connected vertex covers in dense graphs. (English) Zbl 1159.68044

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, 35-48 (2008).
MSC:  68W25 05C70 05C85
Full Text: DOI

Capacitated domination and covering: A parameterized perspective. (English) Zbl 1142.68371

Grohe, Martin (ed.) et al., Parameterized and exact computation. Third international workshop, IWPEC 2008, Victoria, Canada, May 14–16, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79722-7/pbk). Lecture Notes in Computer Science 5018, 78-90 (2008).
MSC:  68Q25 68Q17 68R10
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software