#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1958

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Key Phrases

Learn More

- Ronald Koch, Martin Skutella
- Theory Comput. Syst.
- 2009

We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows over time (also called dynamic flows), flow travels through a network over time and, as a consequence, flow values on edges change over time. This more realistic setting has not been… (More)

- R B KOCH, B STERN, C G FERRARI
- Archives of biochemistry and biophysics
- 1958

- Ronald Koch, Ines Spenke
- Theor. Comput. Sci.
- 2006

Let G = (V, E) be a graph with a source node s and a sink node t, |V | = n, |E| = m. For a given number k, the Maximum k–Splittable Flow Problem (MkSF) is to find an s, t–flow of maximum value with a flow decomposition using at most k paths. In the multicommodity case this problem generalizes disjoint paths problems and unsplittable flow problems. We… (More)

- Ronald Koch, Ebrahim Nasrabadi, Martin Skutella
- Math. Meth. of OR
- 2011

- Ronald Koch, Martin Skutella, Ines Spenke
- WAOA
- 2005

Given a graph with a source and a sink node, the N P –hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths [6]. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k–splittable flow requires two… (More)

- Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese
- APPROX-RANDOM
- 2009

Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions. In order for messages to meet their deadlines, one has to determine a suitable (short) origin-destination path for each message and resolve conflicts between messages whose paths share a… (More)

- Ronald Koch, Martin Skutella, Ines Spenke
- Theory Comput. Syst.
- 2008

Given a graph with a source and a sink node, the N P –hard maximum k–splittable s, t–flow (MkSF) problem is to find a flow of maximum value from s to t with a flow decomposition using at most k paths. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k–splittable flow… (More)

- L K Cutkomp, H H Yap, E Y Cheng, R B Koch
- Chemico-biological interactions
- 1971

- D Desaiah, L K Cutkomp, R B Koch
- Life sciences
- 1973

- R B Koch, D Desaiah, H H Yap, L K Cutkomp
- Bulletin of environmental contamination and…
- 1972