doc/references.bib
author Alpar Juttner <alpar@cs.elte.hu>
Wed, 17 Oct 2018 22:55:02 +0200
changeset 1414 73e29215aaa4
parent 1367 233ad6942a26
permissions -rw-r--r--
Add citation for Vf2pp (#597)
kpeter@790
     1
%%%%% Defining LEMON %%%%%
kpeter@790
     2
kpeter@790
     3
@misc{lemon,
kpeter@790
     4
  key =          {LEMON},
kpeter@790
     5
  title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
kpeter@790
     6
                  {O}ptimization in {N}etworks},
kpeter@1164
     7
  howpublished = {\url{http://lemon.cs.elte.hu/}}
kpeter@790
     8
}
kpeter@790
     9
kpeter@790
    10
@misc{egres,
kpeter@790
    11
  key =          {EGRES},
kpeter@790
    12
  title =        {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
kpeter@790
    13
                  {C}ombinatorial {O}ptimization},
kpeter@801
    14
  url =          {http://www.cs.elte.hu/egres/}
kpeter@790
    15
}
kpeter@790
    16
kpeter@790
    17
@misc{coinor,
kpeter@790
    18
  key =          {COIN-OR},
kpeter@790
    19
  title =        {{COIN-OR} -- {C}omputational {I}nfrastructure for
kpeter@790
    20
                  {O}perations {R}esearch},
kpeter@801
    21
  url =          {http://www.coin-or.org/}
kpeter@790
    22
}
kpeter@790
    23
kpeter@790
    24
kpeter@1219
    25
%%%%% Papers related to LEMON %%%%%
kpeter@1219
    26
kpeter@1219
    27
@article{DezsoJuttnerKovacs11Lemon,
kpeter@1219
    28
  author =       {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs},
kpeter@1219
    29
  title =        {{LEMON} -- an open source {C++} graph template library},
kpeter@1219
    30
  journal =      {Electronic Notes in Theoretical Computer Science},
kpeter@1219
    31
  volume =       {264},
kpeter@1219
    32
  pages =        {23--45},
kpeter@1219
    33
  year =         {2011},
kpeter@1219
    34
  note =         {Proc. 2nd Workshop on Generative Technologies}
kpeter@1219
    35
}
kpeter@1219
    36
kpeter@1219
    37
@article{KiralyKovacs12MCF,
kpeter@1219
    38
  author =       {Z. Kir\'aly and P. Kov\'acs},
kpeter@1219
    39
  title =        {Efficient implementations of minimum-cost flow algorithms},
kpeter@1219
    40
  journal =      {Acta Universitatis Sapientiae, Informatica},
kpeter@1219
    41
  year =         {2012},
kpeter@1219
    42
  volume =       {4},
kpeter@1219
    43
  pages =        {67--118}
kpeter@1219
    44
}
kpeter@1219
    45
alpar@1414
    46
@article{VF2PP,
alpar@1414
    47
  author =       {Alp\'ar J\"uttner and  P\'eter Madarasi},
alpar@1414
    48
  title =        {{VF2++} — An improved subgraph isomorphism algorithm},
alpar@1414
    49
  journal =      {Discrete Applied Mathematics},
alpar@1414
    50
  year =         {2018},
alpar@1414
    51
  volume =       {242},
alpar@1414
    52
  pages =        {69--81},
alpar@1414
    53
  url =          {https://doi.org/10.1016/j.dam.2018.02.018}
alpar@1414
    54
}
alpar@1414
    55
alpar@1414
    56
kpeter@1219
    57
kpeter@790
    58
%%%%% Other libraries %%%%%%
kpeter@790
    59
kpeter@790
    60
@misc{boost,
kpeter@790
    61
  key =          {Boost},
kpeter@790
    62
  title =        {{B}oost {C++} {L}ibraries},
kpeter@801
    63
  url =          {http://www.boost.org/}
kpeter@790
    64
}
kpeter@790
    65
kpeter@790
    66
@book{bglbook,
kpeter@790
    67
  author =       {Jeremy G. Siek and Lee-Quan Lee and Andrew
kpeter@790
    68
                  Lumsdaine},
kpeter@790
    69
  title =        {The Boost Graph Library: User Guide and Reference
kpeter@790
    70
                  Manual},
kpeter@790
    71
  publisher =    {Addison-Wesley},
kpeter@790
    72
  year =         2002
kpeter@790
    73
}
kpeter@790
    74
kpeter@790
    75
@misc{leda,
kpeter@790
    76
  key =          {LEDA},
kpeter@790
    77
  title =        {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and
kpeter@790
    78
                  {A}lgorithms},
kpeter@801
    79
  url =          {http://www.algorithmic-solutions.com/}
kpeter@790
    80
}
kpeter@790
    81
kpeter@790
    82
@book{ledabook,
kpeter@790
    83
  author =       {Kurt Mehlhorn and Stefan N{\"a}her},
kpeter@790
    84
  title =        {{LEDA}: {A} platform for combinatorial and geometric
kpeter@790
    85
                  computing},
kpeter@790
    86
  isbn =         {0-521-56329-1},
kpeter@790
    87
  publisher =    {Cambridge University Press},
kpeter@790
    88
  address =      {New York, NY, USA},
kpeter@790
    89
  year =         1999
kpeter@790
    90
}
kpeter@790
    91
kpeter@790
    92
kpeter@790
    93
%%%%% Tools that LEMON depends on %%%%%
kpeter@790
    94
kpeter@790
    95
@misc{cmake,
kpeter@790
    96
  key =          {CMake},
kpeter@790
    97
  title =        {{CMake} -- {C}ross {P}latform {M}ake},
kpeter@801
    98
  url =          {http://www.cmake.org/}
kpeter@790
    99
}
kpeter@790
   100
kpeter@790
   101
@misc{doxygen,
kpeter@790
   102
  key =          {Doxygen},
kpeter@790
   103
  title =        {{Doxygen} -- {S}ource code documentation generator
kpeter@790
   104
                  tool},
kpeter@801
   105
  url =          {http://www.doxygen.org/}
kpeter@790
   106
}
kpeter@790
   107
kpeter@790
   108
kpeter@790
   109
%%%%% LP/MIP libraries %%%%%
kpeter@790
   110
kpeter@790
   111
@misc{glpk,
kpeter@790
   112
  key =          {GLPK},
kpeter@790
   113
  title =        {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
kpeter@801
   114
  url =          {http://www.gnu.org/software/glpk/}
kpeter@790
   115
}
kpeter@790
   116
kpeter@790
   117
@misc{clp,
kpeter@790
   118
  key =          {Clp},
kpeter@790
   119
  title =        {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
kpeter@801
   120
  url =          {http://projects.coin-or.org/Clp/}
kpeter@790
   121
}
kpeter@790
   122
kpeter@790
   123
@misc{cbc,
kpeter@790
   124
  key =          {Cbc},
kpeter@790
   125
  title =        {{Cbc} -- {Coin-Or} {B}ranch and {C}ut},
kpeter@801
   126
  url =          {http://projects.coin-or.org/Cbc/}
kpeter@790
   127
}
kpeter@790
   128
kpeter@790
   129
@misc{cplex,
kpeter@790
   130
  key =          {CPLEX},
kpeter@790
   131
  title =        {{ILOG} {CPLEX}},
kpeter@801
   132
  url =          {http://www.ilog.com/}
kpeter@790
   133
}
kpeter@790
   134
kpeter@790
   135
@misc{soplex,
kpeter@790
   136
  key =          {SoPlex},
kpeter@790
   137
  title =        {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented
kpeter@790
   138
                  {S}implex},
kpeter@801
   139
  url =          {http://soplex.zib.de/}
kpeter@790
   140
}
kpeter@790
   141
kpeter@790
   142
kpeter@790
   143
%%%%% General books %%%%%
kpeter@790
   144
kpeter@790
   145
@book{amo93networkflows,
kpeter@790
   146
  author =       {Ravindra K. Ahuja and Thomas L. Magnanti and James
kpeter@790
   147
                  B. Orlin},
kpeter@790
   148
  title =        {Network Flows: Theory, Algorithms, and Applications},
kpeter@790
   149
  publisher =    {Prentice-Hall, Inc.},
kpeter@790
   150
  year =         1993,
kpeter@790
   151
  month =        feb,
kpeter@790
   152
  isbn =         {978-0136175490}
kpeter@790
   153
}
kpeter@790
   154
kpeter@790
   155
@book{schrijver03combinatorial,
kpeter@790
   156
  author =       {Alexander Schrijver},
kpeter@790
   157
  title =        {Combinatorial Optimization: Polyhedra and Efficiency},
kpeter@790
   158
  publisher =    {Springer-Verlag},
kpeter@790
   159
  year =         2003,
kpeter@790
   160
  isbn =         {978-3540443896}
kpeter@790
   161
}
kpeter@790
   162
kpeter@790
   163
@book{clrs01algorithms,
kpeter@790
   164
  author =       {Thomas H. Cormen and Charles E. Leiserson and Ronald
kpeter@790
   165
                  L. Rivest and Clifford Stein},
kpeter@790
   166
  title =        {Introduction to Algorithms},
kpeter@790
   167
  publisher =    {The MIT Press},
kpeter@790
   168
  year =         2001,
kpeter@790
   169
  edition =      {2nd}
kpeter@790
   170
}
kpeter@790
   171
kpeter@790
   172
@book{stroustrup00cpp,
kpeter@790
   173
  author =       {Bjarne Stroustrup},
kpeter@790
   174
  title =        {The C++ Programming Language},
kpeter@790
   175
  edition =      {3rd},
kpeter@790
   176
  publisher =    {Addison-Wesley Professional},
kpeter@790
   177
  isbn =         0201700735,
kpeter@790
   178
  month =        {February},
kpeter@790
   179
  year =         2000
kpeter@790
   180
}
kpeter@790
   181
kpeter@790
   182
kpeter@790
   183
%%%%% Maximum flow algorithms %%%%%
kpeter@790
   184
kpeter@802
   185
@article{edmondskarp72theoretical,
kpeter@802
   186
  author =       {Jack Edmonds and Richard M. Karp},
kpeter@802
   187
  title =        {Theoretical improvements in algorithmic efficiency
kpeter@802
   188
                  for network flow problems},
kpeter@802
   189
  journal =      {Journal of the ACM},
kpeter@802
   190
  year =         1972,
kpeter@802
   191
  volume =       19,
kpeter@802
   192
  number =       2,
kpeter@802
   193
  pages =        {248-264}
kpeter@802
   194
}
kpeter@802
   195
kpeter@802
   196
@article{goldberg88newapproach,
kpeter@790
   197
  author =       {Andrew V. Goldberg and Robert E. Tarjan},
kpeter@790
   198
  title =        {A new approach to the maximum flow problem},
kpeter@802
   199
  journal =      {Journal of the ACM},
kpeter@802
   200
  year =         1988,
kpeter@802
   201
  volume =       35,
kpeter@802
   202
  number =       4,
kpeter@802
   203
  pages =        {921-940}
kpeter@790
   204
}
kpeter@790
   205
kpeter@790
   206
@article{dinic70algorithm,
kpeter@790
   207
  author =       {E. A. Dinic},
kpeter@790
   208
  title =        {Algorithm for solution of a problem of maximum flow
kpeter@790
   209
                  in a network with power estimation},
kpeter@790
   210
  journal =      {Soviet Math. Doklady},
kpeter@790
   211
  year =         1970,
kpeter@790
   212
  volume =       11,
kpeter@790
   213
  pages =        {1277-1280}
kpeter@790
   214
}
kpeter@790
   215
kpeter@790
   216
@article{goldberg08partial,
kpeter@790
   217
  author =       {Andrew V. Goldberg},
kpeter@790
   218
  title =        {The Partial Augment-Relabel Algorithm for the
kpeter@790
   219
                  Maximum Flow Problem},
kpeter@790
   220
  journal =      {16th Annual European Symposium on Algorithms},
kpeter@790
   221
  year =         2008,
kpeter@790
   222
  pages =        {466-477}
kpeter@790
   223
}
kpeter@790
   224
kpeter@790
   225
@article{sleator83dynamic,
kpeter@790
   226
  author =       {Daniel D. Sleator and Robert E. Tarjan},
kpeter@790
   227
  title =        {A data structure for dynamic trees},
kpeter@790
   228
  journal =      {Journal of Computer and System Sciences},
kpeter@790
   229
  year =         1983,
kpeter@790
   230
  volume =       26,
kpeter@790
   231
  number =       3,
kpeter@790
   232
  pages =        {362-391}
kpeter@790
   233
}
kpeter@790
   234
kpeter@790
   235
kpeter@790
   236
%%%%% Minimum mean cycle algorithms %%%%%
kpeter@790
   237
kpeter@790
   238
@article{karp78characterization,
kpeter@790
   239
  author =       {Richard M. Karp},
kpeter@790
   240
  title =        {A characterization of the minimum cycle mean in a
kpeter@790
   241
                  digraph},
kpeter@790
   242
  journal =      {Discrete Math.},
kpeter@790
   243
  year =         1978,
kpeter@790
   244
  volume =       23,
kpeter@790
   245
  pages =        {309-311}
kpeter@790
   246
}
kpeter@790
   247
kpeter@1164
   248
@article{hartmann93finding,
kpeter@1164
   249
  author =       {Mark Hartmann and James B. Orlin},
kpeter@1164
   250
  title =        {Finding minimum cost to time ratio cycles with small
kpeter@1164
   251
                  integral transit times},
kpeter@1164
   252
  journal =      {Networks},
kpeter@1164
   253
  year =         1993,
kpeter@1164
   254
  volume =       23,
kpeter@1164
   255
  pages =        {567-574}
kpeter@1164
   256
}
kpeter@1164
   257
kpeter@790
   258
@article{dasdan98minmeancycle,
kpeter@790
   259
  author =       {Ali Dasdan and Rajesh K. Gupta},
kpeter@790
   260
  title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
kpeter@790
   261
                  System Performance Analysis},
kpeter@790
   262
  journal =      {IEEE Transactions on Computer-Aided Design of
kpeter@790
   263
                  Integrated Circuits and Systems},
kpeter@790
   264
  year =         1998,
kpeter@790
   265
  volume =       17,
kpeter@790
   266
  number =       10,
kpeter@790
   267
  pages =        {889-899}
kpeter@790
   268
}
kpeter@790
   269
kpeter@1164
   270
@article{dasdan04experimental,
kpeter@1164
   271
  author =       {Ali Dasdan},
kpeter@1164
   272
  title =        {Experimental analysis of the fastest optimum cycle
kpeter@1164
   273
                  ratio and mean algorithms},
kpeter@1164
   274
  journal =      {ACM Trans. Des. Autom. Electron. Syst.},
kpeter@1164
   275
  year =         2004,
kpeter@1164
   276
  volume =       9,
kpeter@1164
   277
  issue =        4,
kpeter@1164
   278
  pages =        {385-418}
kpeter@1164
   279
} 
kpeter@1164
   280
kpeter@790
   281
kpeter@790
   282
%%%%% Minimum cost flow algorithms %%%%%
kpeter@790
   283
kpeter@790
   284
@article{klein67primal,
kpeter@790
   285
  author =       {Morton Klein},
kpeter@790
   286
  title =        {A primal method for minimal cost flows with
kpeter@790
   287
                  applications to the assignment and transportation
kpeter@790
   288
                  problems},
kpeter@790
   289
  journal =      {Management Science},
kpeter@790
   290
  year =         1967,
kpeter@790
   291
  volume =       14,
kpeter@790
   292
  pages =        {205-220}
kpeter@790
   293
}
kpeter@790
   294
kpeter@802
   295
@article{goldberg89cyclecanceling,
kpeter@790
   296
  author =       {Andrew V. Goldberg and Robert E. Tarjan},
kpeter@790
   297
  title =        {Finding minimum-cost circulations by canceling
kpeter@790
   298
                  negative cycles},
kpeter@802
   299
  journal =      {Journal of the ACM},
kpeter@802
   300
  year =         1989,
kpeter@802
   301
  volume =       36,
kpeter@802
   302
  number =       4,
kpeter@802
   303
  pages =        {873-886}
kpeter@790
   304
}
kpeter@790
   305
kpeter@802
   306
@article{goldberg90approximation,
kpeter@790
   307
  author =       {Andrew V. Goldberg and Robert E. Tarjan},
kpeter@790
   308
  title =        {Finding Minimum-Cost Circulations by Successive
kpeter@790
   309
                  Approximation},
kpeter@790
   310
  journal =      {Mathematics of Operations Research},
kpeter@790
   311
  year =         1990,
kpeter@790
   312
  volume =       15,
kpeter@790
   313
  number =       3,
kpeter@790
   314
  pages =        {430-466}
kpeter@790
   315
}
kpeter@790
   316
kpeter@790
   317
@article{goldberg97efficient,
kpeter@790
   318
  author =       {Andrew V. Goldberg},
kpeter@790
   319
  title =        {An Efficient Implementation of a Scaling
kpeter@790
   320
                  Minimum-Cost Flow Algorithm},
kpeter@790
   321
  journal =      {Journal of Algorithms},
kpeter@790
   322
  year =         1997,
kpeter@790
   323
  volume =       22,
kpeter@790
   324
  number =       1,
kpeter@790
   325
  pages =        {1-29}
kpeter@790
   326
}
kpeter@790
   327
kpeter@790
   328
@article{bunnagel98efficient,
kpeter@790
   329
  author =       {Ursula B{\"u}nnagel and Bernhard Korte and Jens
kpeter@790
   330
                  Vygen},
kpeter@790
   331
  title =        {Efficient implementation of the {G}oldberg-{T}arjan
kpeter@790
   332
                  minimum-cost flow algorithm},
kpeter@790
   333
  journal =      {Optimization Methods and Software},
kpeter@790
   334
  year =         1998,
kpeter@790
   335
  volume =       10,
kpeter@790
   336
  pages =        {157-174}
kpeter@790
   337
}
kpeter@790
   338
kpeter@802
   339
@book{dantzig63linearprog,
kpeter@802
   340
  author =       {George B. Dantzig},
kpeter@802
   341
  title =        {Linear Programming and Extensions},
kpeter@802
   342
  publisher =    {Princeton University Press},
kpeter@802
   343
  year =         1963
kpeter@802
   344
}
kpeter@802
   345
kpeter@790
   346
@mastersthesis{kellyoneill91netsimplex,
kpeter@790
   347
  author =       {Damian J. Kelly and Garrett M. O'Neill},
kpeter@790
   348
  title =        {The Minimum Cost Flow Problem and The Network
kpeter@790
   349
                  Simplex Method},
kpeter@790
   350
  school =       {University College},
kpeter@790
   351
  address =      {Dublin, Ireland},
kpeter@790
   352
  year =         1991,
kpeter@999
   353
  month =        sep
kpeter@790
   354
}
kpeter@999
   355
kpeter@999
   356
%%%%% Other algorithms %%%%%
kpeter@999
   357
kpeter@999
   358
@article{grosso08maxclique,
kpeter@999
   359
  author =       {Andrea Grosso and Marco Locatelli and Wayne Pullan},
kpeter@999
   360
  title =        {Simple ingredients leading to very efficient
kpeter@999
   361
                  heuristics for the maximum clique problem},
kpeter@999
   362
  journal =      {Journal of Heuristics},
kpeter@999
   363
  year =         2008,
kpeter@999
   364
  volume =       14,
kpeter@999
   365
  number =       6,
kpeter@999
   366
  pages =        {587--612}
kpeter@999
   367
}
alpar@1351
   368
alpar@1351
   369
@article{cordella2004sub,
kpeter@1367
   370
  author =       {Cordella, Luigi P. and Foggia, Pasquale and Sansone,
kpeter@1367
   371
                  Carlo and Vento, Mario},
kpeter@1367
   372
  title =        {A (sub)graph isomorphism algorithm for matching
alpar@1351
   373
                  large graphs},
kpeter@1367
   374
  journal =      {IEEE Transactions on Pattern Analysis and Machine
kpeter@1367
   375
                  Intelligence},
kpeter@1367
   376
  volume =       26,
kpeter@1367
   377
  number =       10,
kpeter@1367
   378
  pages =        {1367--1372},
kpeter@1367
   379
  year =         2004
alpar@1351
   380
}