Bell Labs Algorithms Pow Wow

Abstract

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 Steiner Tree, network design: orientation constraints edge-coloring dynamic bipartite multi-graphs, edge coloring bipartite multi-hypergraphs, optimal cost chromatic partition (OCCP), single source unsplittable flow, confluent flow, combinatorial algorithms for short-path decomposable flows, shortest path routing, and packing dijoins and feedback arc sets. In each of these areas the problems were identified and progress made during the meeting was presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 06, 2004
Accession Number
ADA423096

Entities

People

  • Anuparn Gupta
  • Chandra Chekuri
  • F. B. Shepherd
  • Hadas Shachnai
  • Vahab Mirrokni

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • Classification
  • Computer Programming
  • Feedback
  • Information Operations
  • Instructions
  • Military Research
  • Monitoring
  • Mountains
  • Orientation (Direction)
  • Scheduling (Production)
  • Security
  • Standards

Readers

  • Educational Psychology
  • Graph Algorithms and Convex Optimization.
  • Operations Research