Sciweavers

Share
NETWORKS
2008
9 years 9 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
DEXA
2010
Springer
182views Database» more  DEXA 2010»
9 years 9 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
9 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
SAC
2000
ACM
10 years 2 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
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
IV
2002
IEEE
87views Visualization» more  IV 2002»
10 years 2 months ago
Visualization of Document Co-Citation Counts
Visualization can facilitate the understanding of the structures of a collection of documents that are related to each other by links, such as citations in formal publications. We...
Steven Noel, Chee-Hung Henry Chu, Vijay Raghavan
PPSN
2004
Springer
10 years 3 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
IFIP
2004
Springer
10 years 3 months ago
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
10 years 3 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
ICTAI
2006
IEEE
10 years 3 months ago
Minimum Spanning Tree Based Clustering Algorithms
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
books