Search Sciweavers | Sciweavers

628 search results - page 4 / 126

» The minimum shift design problem

click to vote

JCO
2010

182views more JCO 2010»

Polynomial time approximation schemes for minimum disk cover problems

14 years 7 months ago

Download www.ece.mtu.edu

The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...

Chen Liao, Shiyan Hu

claim paper

Read More »

click to vote

SAC
2000
ACM

170views Applied Computing» more SAC 2000»

A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

15 years 1 months ago

Download www.ads.tuwien.ac.at

The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...

Günther R. Raidl, Bryant A. Julstrom

claim paper

Read More »

116

click to vote

COR
2008

142views more COR 2008»

Modeling and solving the rooted distance-constrained minimum spanning tree problem

14 years 9 months ago

Download www.math.tu-dresden.de

In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...

Luis Gouveia, Ana Paias, Dushyant Sharma

claim paper

Read More »

120

click to vote

IPCO
2001

184views Optimization» more IPCO 2001»

Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

14 years 10 months ago

Download www.cs.dartmouth.edu

Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...

Clifford Stein, David P. Wagner

claim paper

Read More »

click to vote

FOCS
2010
IEEE

151views Theoretical Computer Science» more FOCS 2010»

Minimum-Cost Network Design with (Dis)economies of Scale

14 years 6 months ago