Suchergebnisse - G.2.1 [Discrete Mathematics]: Combinatorics-combinatorial algorithms
-
1
Autoren:
Weitere Verfasser:
Schlagwörter: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf
-
2
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimality proofs, Tower of Hanoi ACM Reference Format
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358; http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf
-
3
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analyis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Variable-speed processor, flow time, online algorithms, competitive analysis, offline algorithms, dynamic programming ACM Reference Format
Dateibeschreibung: application/pdf
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Journal of the ACM. 45:123-154
Schlagwörter: F.1.3 [Computaion by Abstract Devices]: Complexity Classes - relations among randomized complexity classes, G.2.1 [Discrete Mathematics]: Combinatorics - combinatorial algorithms, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, RP algorithms, G.3 [Probability and Statistics]: probabilistic algorithms, 01 natural sciences, Algorithms, bipartite multigraph
Dateibeschreibung: application/xml
-
5
Autoren:
Weitere Verfasser:
Schlagwörter: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448; http://arxiv.org/pdf/cs/0609103v2.pdf
-
6
Autoren:
Weitere Verfasser:
Schlagwörter: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691; http://arxiv.org/pdf/cs/0609103v1.pdf
-
7
Autoren:
Weitere Verfasser:
Schlagwörter: General Terms, Algorithms Additional Key Words and Phrases, CAT algorithm, chord diagram, free plane tree, necklace, planar tree, rooted plane tree
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.6103; http://www.cis.uoguelph.ca/~sawada/papers/tree.pdf
-
8
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics – Combinatorial Algorithms, G.2.2 [Discrete Mathematics, Graph Theory – Graph Algorithms General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Approximation Algorithms, Cake-cutting, Fairness, Game Theory, Truthfulness
Dateibeschreibung: application/pdf
-
9
Autoren:
Weitere Verfasser:
Schlagwörter: ACM Categories and Subject Descriptors. E.1 [Data Structures, Distributed data structures, Graphs and networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures, Routing and layout, G.2 [Discrete Mathematics, G.2.1 Combinatorics – Combinatorial algorithms, G.2.2 Graph Theory – Graph algorithms, Graph labeling, Network problems. C.2.2 [Computer- Communication Networks, Network Protocols – Routing protocols. ACM General Terms. Algorithms, Performance, Theory Keywords. Routing schemes, multi-cast trees, distance labeling, triangulation, grid dimension, growthconstrained metrics, locality-awareness
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460; http://research.microsoft.com/users/slivkins/podc07_full.pdf
-
10
Autoren:
Weitere Verfasser:
Quelle: http://web.eecs.umich.edu/~pettie/matching/Agarwal-Varadarajan-bichromatic-euclidean-mwpm-approx.pdf.
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Nonnumerical Algorithms and Problems—geometrical problems and computations, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial complexity General Terms, Theory, Combinatorial Optimization Keywords, Matching, approximation algorithms
Dateibeschreibung: application/pdf
-
11
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Nonnumerical Algorithms and Problems—Geometrical problems and computations, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms
Dateibeschreibung: application/pdf
-
12
Autoren:
Weitere Verfasser:
Schlagwörter: CR Categories, D.2.2 [Software Engineering, Tools and Techniques—User interfaces, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithm, J.3 [Life and Medical Sciences, Biology and genetics—, Keywords, visualization, combinatorics, bioinformatics, graph drawing, sequence alignment
Dateibeschreibung: application/pdf
-
13
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors, G.2.1 [Discrete Mathematics, Combinatorics— combinatorial algorithms, I.2.8 [Artificial Intelligence, Problem Solving, Control Methods, and Search—heuristic methods General Terms, Algorithms Additional Key Words and Phrases, Metaheuristics, combinatorial optimization, intensification, diversification. C. Blum acknowledges support by the “Metaheuristics Network, ” a Research Training Network funded by
Dateibeschreibung: application/pdf
-
14
Autoren:
Weitere Verfasser:
Schlagwörter: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.6266; http://arxiv.org/pdf/cs/0604020v1.pdf
-
15
Autoren:
Weitere Verfasser:
Schlagwörter: Categories and Subject Descriptors G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms, I.2.11 [Artificial Intelligence, Distributed Artificial Intelligence—Parallel heuristic methods General Terms Algorithms Keywords Par, Cross Entropy Algorithm, Maximum Clique Problem
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.7628; http://www.cs.york.ac.uk/rts/docs/GECCO_2007/docs/p2401.pdf
-
16
Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics--Combinatorial algorithms General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, Approximation algorithms, local ratio technique, scheduling, resource allocation, fractional local ratio
Dateibeschreibung: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.1813; http://www.cs.technion.ac.il/~reuven/PS/survay04.ps
-
17
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial Algorithms, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph Theory General Terms, Algorithms, Experimentation, Performance Additional Key Words and Phrases, Matroids, Matroid Optimization, Multicriteria Optimization, Local Search, Tabu Search, Non-linear combinatorial optimization, Multiobjective Optimization
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1553; http://www.math.ucdavis.edu/~deloera/RECENT_WORK/Fyn.pdf
-
18
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimality proofs, Tower of Hanoi ACM Reference Format
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.4840; http://www.cs.bgu.ac.il/~shayso/Papers/ASS08.pdf
-
19
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory, Performance Additional Key Words and Phrases, Mean flow time, uniform machines, deadline constraints, polynomial-time algorithms
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.7075; http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf
-
20
Autoren:
Weitere Verfasser:
Schlagwörter: Mathematical Logic—Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, complexity, Constraint Satisfaction Problem, dichotomy theorem, homomorphism
Dateibeschreibung: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder