University of Hamburg - to research, to teach, to educate and form, to homepage
base.camp
Department of Informaticsbase.camp

Photo: UHH/Denstorf

Solve the Dominating Set Problem (DSP) - PACE Challenge 2025

3 March 2025, by Omkar Kondhalkar

galexy

Photo: base.camp

Project aims to solve the Dominating Set Problem (DSP) on graphs for the PACE Challenge 2025. The goal is to develop highly effective exact and heuristic algorithms to find a minimal vertex set D that 'touches' all other vertices. Implementation will be in Rust, built upon prior theoretical insights into solution quality vs. runtime. The core process involves an iterative development cycle with rigorous performance profiling and optimization. The main focus is creating a practical heuristic capable of handling large graph instances efficiently. Success is measured by comparing runtime and solution quality against official benchmarks and other competitive methods. 

Latest articles

Speedrunning Pok´emon Emerald

Photo: Arian Urdu

22.08.2025|basecamp-projects
PokéAgent Challenge (NeurIPS 2025)

Addressing the NeurIPS 2025 PokéAgent Challenge (Track 2: Speedrunning Pokémon Emerald) by comparing Large Language Model agents (LLMs) and Deep Reinforcement Learning (RL). The core problem is automating the speedrun of the game without hard-coded solutions, a task demanding long-term planning and...

symbolic illustration of traffic analysis in encrypted networks

Photo: Mistral

20.04.2025|basecamp-projects
SoK: Detection of Attacks in Encrypted Traffic

Widespread adoption of HTTPS and encryption severely limits NIDS visibility, rendering traditional Deep-Packet Inspection ineffective without decryption. The core problem is Detection of Attacks in Encrypted Traffic Without Traffic Decryption, avoiding overhead and MITM risks.
This project...