ENDM
2008
13 years 12 months ago
2008
ENDM
2010
14 years 15 days ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
ENDM
2010
14 years 15 days ago
2010
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
ENDM
2010
14 years 15 days ago
2010
Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunate...
ENDM
2010
14 years 15 days ago
2010
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
ENDM
2010
14 years 15 days ago
2010
Electronic Notes in Discrete Mathematics 36 (2010) 1065
ENDM
2010
14 years 15 days ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
ENDM
2010
14 years 15 days ago
2010
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
ENDM
2010
14 years 15 days ago
2010
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
ENDM
2010
14 years 15 days ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...