For two weeks researchers in algorithms gathered to remind each other of some old unsolved problems and to present some new ones. People broke off into groups according to their interest in certain problems. Problems were presented in the following areas: the k-cut and multiway cut, Min-max programming, triangle finding in linear time, directed multicut, minimum power k-connected subgraph job scheduling with communication delays bounded-degree biclique cover, metric labeling, priority ...
Reports by Author
