Sciweavers

COLOGNETWENTE
2008
13 years 10 months ago
Classbased Detailed Routing in VLSI Design
Christian Schulte 0002, Tim Nieberg
COLOGNETWENTE
2008
13 years 10 months ago
The Uncapacitated Swapping Problem
Shoshana Anily, Aharona Pfeffer
COLOGNETWENTE
2008
13 years 10 months ago
Reformulations in Mathematical Programming: Definitions
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
Leo Liberti
COLOGNETWENTE
2008
13 years 10 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze
COLOGNETWENTE
2008
13 years 10 months ago
On the Facial Structure of the Common Edge Subgraph polytope
Gordana Manic, Laura Bahiense, Cid C. de Souza
COLOGNETWENTE
2008
13 years 10 months ago
On minimum reload cost paths, tours and flows
Edoardo Amaldi, Giulia Galbiati, Francesco Maffiol...
COLOGNETWENTE
2007
13 years 10 months ago
On revenue equivalence in truthful mechanisms
Birgit Heydenreich, Rudolf Müller, Marc Uetz,...
COLOGNETWENTE
2007
13 years 10 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
COLOGNETWENTE
2007
13 years 10 months ago
Edge cover by bipartite subgraphs
Marie-Christine Plateau, Leo Liberti, Laurent Alfa...