Sciweavers

2137 search results - page 325 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
AIR
2006
46views more  AIR 2006»
15 years 2 months ago
Spatial inference with geometric proportional analogies
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
Emma-Claire Mullally, Diarmuid P. O'Donoghue
100
Voted
ATMOS
2010
136views Optimization» more  ATMOS 2010»
15 years 1 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
120
Voted
LATA
2009
Springer
15 years 9 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
122
Voted
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
15 years 8 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
118
Voted
ECCC
2006
88views more  ECCC 2006»
15 years 2 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna