Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Keywords=combinatorial search
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Theoretical Computer Science
417
, 2012, pp. 23-35
Searching for an axis-parallel shoreline
Elmar Langetepe
Theoretical Computer Science
447
, 2012, pp. 85-99
Reconstructing weighted graphs with minimal query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Theoretical Computer Science
412
(19), 2011, pp. 1782-1790
Maximizing non-monotone submodular functions
Uriel Feige
,
Vahab S. Mirrokni
,
Jan Vondrák
SIAM Journal on Computing
40
(4), 2011, pp. 1133-1153
An ejection chain algorithm for the quadratic assignment problem
Cesar Rego
,
Tabitha James
,
Fred Glover
Networks
56
(3), 2010, pp. 188-206
Optimal resilient sorting and searching in the presence of memory faults
Irene Finocchi
,
Fabrizio Grandoni
,
Giuseppe F. Italiano
Theoretical Computer Science
410
(44), 2009, pp. 4457-4470
Improved combinatorial algorithms for facility location problems
Moses Charikar
,
Sudipto Guha
SIAM Journal on Computing
34
(4), 2005, pp. 803-824
Ant colony optimization theory: A survey
Marco Dorigo
,
Christian Blum
Theoretical Computer Science
344
(2-3), 2005, pp. 243-278
Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms
Petteri Kaski
SIAM Journal on Discrete Mathematics
19
(3), 2005, pp. 664-690
An effective local search for the maximum clique problem
Kengo Katayama
,
Akihiro Hamamoto
,
Hiroyuki Narihisa
Information Processing Letters
95
(5), 2005, pp. 503-511
Learning a hidden matching
Noga Alon
,
Richard Beigel
,
Simon Kasif
,
Steven Rudich
,
Benny Sudakov
SIAM Journal on Computing
33
(2), 2004, pp. 487-501
A conjecture on Wiener indices in combinatorial chemistry
Yih-En Andrew Ban
,
Sergey Bereg
,
Nabil H. Mustafa
Algorithmica
40
(2), 2004, pp. 99-117
Approximate local search in combinatorial optimization
James B. Orlin
,
Abraham P. Punnen
,
Andreas S. Schulz
SIAM Journal on Computing
33
(5), 2004, pp. 1201-1214
New results of exhaustive search in the game Amazons
Raymond Georg Snatzke
Theoretical Computer Science
313
(3), 2004, pp. 499-509
Efficiency of local search with multiple local optima
Josselin Garnier
,
Leila Kallel
SIAM Journal on Discrete Mathematics
15
(1), 2001-2002, pp. 122-141
Probe order backtracking
Paul Walton, Jr. Purdom
,
G. Neil Haven
SIAM Journal on Computing
26
(2), 1997, pp. 456-483
On the generation of random binary search trees
Luc Devroye
,
John Michael Robson
SIAM Journal on Computing
24
(6), 1995, pp. 1141-1156
A parallel tabu search algorithm for large traveling salesman problems
C.-N. Fiechter
Discrete Applied Mathematics
51
(3), 1994, pp. 243-267
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
C. Rhee
,
Y. Daniel Liang
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
49
, 1994, pp. 45-50
Heuristics for graph coloring
D. de Werra
Computing Supplementum
7
, 1990, pp. 191-208
The combinatorics of local constraints in model-based recognition and localization from sparse data
W.E.L. Grimson
Journal of the ACM
33
(4), 1986, pp. 658-686