Search Results for author:
Found 2 papers, 0 papers with code
Fixed-Parameter Algorithms for Graph Constraint Logic
While such restrictions on the structure of constraint graphs do not seem to limit the expressiveness of NCL, the building blocks of the constraint graphs cannot be limited without losing expressiveness: We consider as parameters the number of weight-one edges and the number of weight-two edges of a constraint graph, as well as the number of \textsc{and}\xspace or \textsc{or}\xspace vertices of an \textsc{and/or}\xspace constraint graph.
Data Structures and Algorithms
A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem
Furthermore, we introduce a measure of the quality of a solution to a max-min fair optimization problem.
