Benchmarks
You may also want to:
Here, we collect solved instances of our portal's users. By allowing public publishing the results of your tasks,
they will automatically appear on the list.
All the computations are performed on the highperformance computer that is available at University of Ljubljana, Faculty of Mechanical Engineering.
There is an Intel Xeon X5670 (1536 hypercores) HPC cluster and an E52680 V3 (1008 hypercores) DP cluster, with IB QDR interconnection, 164 TB of LUSTRE storage,
4.6 TB RAM and with 24 TFlop/s performance.
Name

Function

Solution Type

Contributor

Nodes

Density

Solution

#Cores

Execution Time (s)


ax Cut gka1a (Inst. of ax Cut gka1a)

MaxCut

Optimal

jpovh

50

0.127

1762

48

0.28


Compute max cut on be100.3 graph with opposite edge weights (be100.3minus)

MaxCut

Optimal

jpovh
Origin: well known graph, but with negative edge weights

101

0.99

4391

12

5.62


Compute max cut on graphs with opposite edge weights be100.10 (Graph_100_05_a)
Random graph on 100 nodes with density 0.05

MaxCut

Optimal

jpovh

100

0.049

197

48

0.91


Compute max cut on graphs with opposite edge weights be100.10 (Inst. of Compute max cut on graphs with opposite edge weights be100.10)

MaxCut

Optimal

jpovh

101

0.991

3838

48

5.36


Compute max cut on graphs with opposite edge weights be100.2 (be100.2minus)
this is be100.2 without diagonal and multiplied with (1)

MaxCut

Optimal

jpovh

101

0.991

4322

12

6.02


Compute max cut on graphs with opposite edge weights be100.2 (Inst. of Compute max cut on graphs with opposite edge weights be100.2)

MaxCut

Optimal

jpovh

101

0.991

4322

12

6.05


Compute max cut on graphs with opposite edge weights be100.6 (be100.6minus)
Max cut instnce be100.6 with zero diagonal and negative weights

MaxCut

Optimal

jpovh

101

0.989

4343

12

4.44


Experiment 2'2' 09 03 (Graph_100_05_a)
Random graph on 100 nodes with density 0.05

MaxCut

Optimal

jpovh

100

0.049

197

48

0.94


fistattempt (bcc16601.mc)
biconnected unweighted graph

MaxCut

Optimal

mjuenger
Origin: Michael Jünger

160

0.191

2181

48

0.11


G1 graph (Inst. of G1 graph)

MaxCut

Approximate

Jelena

800

0.06

11624

96

85003.88


G10 graph (Inst. of G10 graph)

MaxCut

Approximate

Jelena

800

0.06

1998

96

85030.52


G11 graph (Inst. of G11 graph)

MaxCut

Approximate

Jelena

800

0.005

564

96

85087.54


G12 graph (Inst. of G12 graph)

MaxCut

Approximate

Jelena

800

0.005

556

96

85066.73


G13 graph (Inst. of G13 graph)

MaxCut

Approximate

Jelena

800

0.005

582

96

85000.96


G14 graph (Inst. of G14 graph)

MaxCut

Approximate

Jelena

800

0.015

3059

96

85029.08


G15 graph (Inst. of G15 graph)

MaxCut

Approximate

Jelena

800

0.015

3049

96

85001.13


G16 graph (Inst. of G16 graph)

MaxCut

Approximate

Jelena

800

0.015

3050

96

85010.87


G17 graph (Inst. of G17 graph)

MaxCut

Approximate

Jelena

800

0.015

3044

96

85017.96


G18 graph (Inst. of G18 graph)

MaxCut

Approximate

Jelena

800

0.015

990

96

85009.2


G19 graph (Inst. of G19 graph)

MaxCut

Approximate

Jelena

800

0.015

904

96

85014.78

