1272 search results - page 107 / 255 » The Set Cover with Pairs Problem |
126
click to vote
EOR
2008
15 years 3 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
117
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
132
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
141
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
125
click to vote
EVOW
2001
Springer
15 years 8 months ago
2001
Springer
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constrain...