optimization | Sciweavers

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

claim paper

Read More »

40

click to vote

COLOGNETWENTE
2008

77views Optimization» more COLOGNETWENTE 2008»

A Simple 3-Approximation of Minimum Manhattan Networks

14 years 1 months ago

Download www.zaik.uni-koeln.de

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

claim paper

Read More »

24

click to vote

COLOGNETWENTE
2008

82views Optimization» more COLOGNETWENTE 2008»

On the Facial Structure of the Common Edge Subgraph polytope

14 years 1 months ago

Download www.ic.unicamp.br

Gordana Manic, Laura Bahiense, Cid C. de Souza

claim paper

Read More »

16

click to vote

COLOGNETWENTE
2008

66views Optimization» more COLOGNETWENTE 2008»

On minimum reload cost paths, tours and flows

14 years 1 months ago

Download ctw08.dti.unimi.it

Edoardo Amaldi, Giulia Galbiati, Francesco Maffiol...

claim paper

Read More »

26

click to vote

COLOGNETWENTE
2007

61views Optimization» more COLOGNETWENTE 2007»

A useful characterization of the feasible region of binary linear programs

14 years 1 months ago

Download www.lix.polytechnique.fr

Leo Liberti

claim paper

Read More »

19

click to vote

COLOGNETWENTE
2007

77views Optimization» more COLOGNETWENTE 2007»

On revenue equivalence in truthful mechanisms

14 years 1 months ago

Download drops.dagstuhl.de

Birgit Heydenreich, Rudolf Müller, Marc Uetz,...

claim paper

Read More »

47

click to vote

COLOGNETWENTE
2007

209views Optimization» more COLOGNETWENTE 2007»

Approximating minimum independent dominating sets in wireless networks

14 years 1 months ago

Download doc.utwente.nl

We present the ﬁrst 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

claim paper

Read More »

22

click to vote

COLOGNETWENTE
2007

77views Optimization» more COLOGNETWENTE 2007»

Edge cover by bipartite subgraphs

14 years 1 months ago