Sciweavers

Share
ENDM
2008
85views more  ENDM 2008»
8 years 6 months ago
Structural Properties of Sparse Graphs
Jaroslav Nesetril
ENDM
2010
122views more  ENDM 2010»
8 years 6 months ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
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...
Vinícius G. P. de Sá, Celina M. Herr...
ENDM
2010
130views more  ENDM 2010»
8 years 6 months ago
Experimental Analysis of an Online Trading Algorithm
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...
Günter Schmidt, Esther Mohr, Mike Kersch
ENDM
2010
72views more  ENDM 2010»
8 years 6 months ago
Earliest Arrival Flows in Networks with Multiple Sinks
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...
Melanie Schmidt, Martin Skutella
ENDM
2010
86views more  ENDM 2010»
8 years 6 months ago
Mathematical programming based debugging
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...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
ENDM
2010
101views more  ENDM 2010»
8 years 6 months ago
Finding Gale Strings
Electronic Notes in Discrete Mathematics 36 (2010) 1065
Marta M. Casetti, Julian Merschen, Bernhard von St...
ENDM
2010
101views more  ENDM 2010»
8 years 6 months ago
Strong Lower Bounds for a Survivable Network Design Problem
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...
Markus Leitner, Günther R. Raidl
ENDM
2010
126views more  ENDM 2010»
8 years 6 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
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, ...
Özgür Ülker, Dario Landa-Silva
ENDM
2010
84views more  ENDM 2010»
8 years 6 months ago
Formulation symmetries in circle packing
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...
Alberto Costa, Leo Liberti, Pierre Hansen
ENDM
2010
100views more  ENDM 2010»
8 years 6 months ago
Balanced list edge-colourings of bipartite graphs
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...
Tamás Fleiner, András Frank
books