Sciweavers

1404 search results - page 21 / 281
» Optimization problems in multiple-interval graphs
Sort
View
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 4 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
ACL
2010
13 years 7 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
DATE
1997
IEEE
80views Hardware» more  DATE 1997»
14 years 1 months ago
Hybrid symbolic-explicit techniques for the graph coloring problem
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mat...
JCT
2008
100views more  JCT 2008»
13 years 9 months ago
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
Frank Vallentin