Skip to main navigation
Skip to search
Skip to main content
the University of Bath's research portal Home
Help & FAQ
Home
Profiles
Research output
Projects
Datasets
Student theses
Equipment
Research Units
Search by expertise, name or affiliation
Limit theory of combinatorial optimization for random geometric graphs
Dieter Mitsche,
Mathew D. Penrose
Department of Mathematical Sciences
Centre for Networks and Collective Behaviour
EPSRC Centre for Doctoral Training in Statistical Applied Mathematics (SAMBa)
Probability Laboratory at Bath
Research output
:
Contribution to journal
›
Article
›
peer-review
10
Downloads (Pure)
Overview
Fingerprint
Profiles
(1)
Fingerprint
Dive into the research topics of 'Limit theory of combinatorial optimization for random geometric graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Random Geometric Graph
92%
Combinatorial Optimization
75%
Domination number
68%
Superadditivity
49%
Bipartite Matching
47%
Subadditivity
44%
Travelling salesman
43%
Thermodynamic Limit
43%
D-space
43%
Covering number
41%
Clique number
39%
Independence number
38%
Strong law of large numbers
37%
Polynomial Growth
37%
Law of large numbers
37%
Travelling salesman problems
35%
Thermodynamics
34%
Spanning tree
33%
Packing
32%
Weight Function
30%
Triangle
28%
Scaling
28%
Euclidean
27%
Class
19%
Graph in graph theory
15%
Business & Economics
Law of Large numbers
100%
Combinatorial Optimization
84%
Thermodynamics
73%
Graph
62%
Domination
59%
Superadditivity
54%
Traveling Salesman
53%
Subadditivity
49%
Spanning Tree
47%
Clique
45%
Traveling Salesman Problem
44%
Scaling
39%
General Theory
37%
Polynomials
32%