Combinatorial Geometry and Approximation Algorithms

被引：0

作者：

Chan, Timothy M. ^{[1
]}

机构：

[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada

来源：

ALGORITHMS AND COMPUTATION, ISAAC 2012 | 2012年 / 7676卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：2 / 2

页数：1

共 50 条

[41] A BRIEF INTRODUCTION TO EXACT, APPROXIMATION, AND HEURISTIC ALGORITHMS FOR SOLVING HARD COMBINATORIAL OPTIMIZATION PROBLEMS
Festa, P.
[J]. 2014 16TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2014,
[42] A METHOD IN COMBINATORIAL GEOMETRY
KELLEY, JB
[J]. AMERICAN MATHEMATICAL MONTHLY, 1965, 72 (09): : 1061 - &
[43] Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts
Song, JJ
Regan, A
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (10) : 914 - 933
[44] ON A PROBLEM IN COMBINATORIAL GEOMETRY
RODL, V
[J]. DISCRETE MATHEMATICS, 1983, 45 (01) : 129 - 131
[45] ON COMBINATORIAL AND PROJECTIVE GEOMETRY
DRESS, AWM
WENZEL, W
[J]. GEOMETRIAE DEDICATA, 1990, 34 (02) : 161 - 197
[46] GEOMETRY OF COMBINATORIAL MANIFOLDS
PENNA, MA
[J]. PACIFIC JOURNAL OF MATHEMATICS, 1978, 77 (02) : 499 - 522
[47] Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
Lee, Timothy
Mitchell, John E.
[J]. DISCRETE OPTIMIZATION, 2017, 24 : 152 - 169
[48] Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs
Bonnet, Edouard
Escoffier, Bruno
Paschos, Vangelis Th.
Stamoulis, Georgios
[J]. DISCRETE OPTIMIZATION, 2018, 27 : 26 - 56
[49] Discrete combinatorial geometry
Kenmochi, Y
Imiya, A
Ichikawa, A
[J]. PATTERN RECOGNITION, 1997, 30 (10) : 1719 - 1728
[50] ON A PROBLEM OF COMBINATORIAL GEOMETRY
BELOV, AY
[J]. RUSSIAN MATHEMATICAL SURVEYS, 1992, 47 (03) : 167 - 168

← 1 2 3 4 5 →