1101 search results - page 93 / 221 » An Algorithm for the Graph Crossing Number Problem |
179
Voted
FSTTCS
1993
Springer
15 years 9 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
127
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
157
click to vote
COR
2011
14 years 12 months ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
145
click to vote
MICAI
2007
Springer
15 years 11 months ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
135
click to vote
HEURISTICS
2008
15 years 4 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...