„Partial cover problems“

Suchergebnisse

5 Treffer

• Approximation Algorithms for Union and Intersection Covering Problems
  Cygan, Marek ; Grandoni, Fabrizio ; Leonardi, Stefano ; Mucha, Marcin ; Pilipczuk, Marcin ; Sankowski, Piotr 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solving Partial Dominating Set and Related Problems Using Twin-Width
  Balabán, Jakub ; Mock, Daniel ; Rossmanith, Peter 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Algorithms for Partial Cover Problems
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
  Amini, Omid ; Fomin, Fedor ; Saurabh, Saket 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
  Liang, Wei ; Zhang, Zhao ; Du, Ding-Zhu