Sciweavers

9532 search results - page 299 / 1907
» Logic, Graphs, and Algorithms
Sort
View
TIT
1998
79views more  TIT 1998»
15 years 6 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 7 months ago
Graph limits and parameter testing
Christian Borgs, Jennifer T. Chayes, Lászl&...
STOC
2004
ACM
73views Algorithms» more  STOC 2004»
16 years 7 months ago
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
Jonathan A. Kelner
139
Voted
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 4 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 10 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro