Article

Free access

On linear-time deterministic algorithms for optimization problems in fixed dimension

Authors:

Bernard Chazelle,

Jiří MatoušekAuthors Info & Claims

SODA '93: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms

Pages 281 - 290

Published: 01 January 1993 Publication History

PDF eReader

References

[1]

B. Berger and J. Rompel. Simulating (log n)C-wise independence in NC. Journal of the ACM, 38(4):1028- 1046, 1991.

Digital Library

Google Scholar

[2]

B. Berger, J. Rompel, and P. W. Shor. Efficient N C algorithms for set cover with applications to learning and geometry. In Proc. 30. IEEE Symposium on Foundations of Computer Science, pages 54-59, 1989.

Digital Library

Google Scholar

[3]

B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10(3):229-249, 1990.

Google Scholar

[4]

B. Chazelle. Cutting hyperplanes for divide-andconquer. Tech. report CS-TR-335-91, Princeton University, 1991. Preliminary version: Proc. 32. IEEE Symposium on Foundations of Computer Science, 29- 38, October 1991.

Digital Library

Google Scholar

[5]

K. Clarkson. Linear programming in O(nx3d2) time. In.formation Processing Letters, 22(1):21-24, 1986.

Digital Library

Google Scholar

[6]

K. Clarkson. Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29. IEEE Symposium on Foundations of Computer Science, pages 452-457, 1988.

Google Scholar

[7]

M. E. Dyer and A. M. Frieze. A randomized algorithm for fixed-dimensional linear programming. Manuscript, 1987.

Google Scholar

[8]

L. Danzer, D. Laugwitz, and H. Lenz. Uber das LSwnersche Ellipsoid und seine Anlagen unter den einem EikSrper einbeschriebenen Ellipsoid. Archiv der Mathematik, 8:214-219, 1957.

Google Scholar

[9]

E. M. Dyer. On a multidimensional search technique and its application to the Euclidean 1-centre problem. SiAM Journal on Computing, 15:725-738, 1986.

Digital Library

Google Scholar

[10]

M. E. Dyer. A dass of convex programs with applications to computational geometry. In Proc. 8. A CM Symposium on Computational Geometry, pages 9-15, 1992.

Digital Library

Google Scholar

[11]

B. Gilrtner. Abstract optimization problems. In Proc. 33. IEEE Symposium on Foundations of Computer Science, 1992. To appear.

Google Scholar

[12]

D. Haussler and E. Welzl. e-nets and simplex range queries. Discrete ~ Computational Geometry, 2:127- 151, 1987.

Google Scholar

[13]

F. Juhnke. Volumenminimale Ellipsoidiiberdeckungen. Beitrdige zur Algebra und Geometrie, 30:143-153, 1990.

Google Scholar

[14]

G. KaJai. A subexponential randomized simplex algorithm. In Proc. ~~. A CM Symposium on Theory of Computing, 1992.

Digital Library

Google Scholar

[15]

N. Karmakar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.

Digital Library

Google Scholar

[16]

L. G. Khachiyan. Polynomial Mgorithm in linear programming. U.S.S.R. Comput. Math. and Math. Phys., 20:53-72, 1980.

Google Scholar

[17]

J. Koml6s, J. Pach, and G. WSginger. Almost tight bounds for epsilon-nets. Discrete f.4 Computational Geometry, 1992. To appear.

Google Scholar

[18]

J. Matou.%k. Approximations and optimal geometric divide-and-conquer. In Proc. ~3. A CM Symposium on Theory of Computing, pages 506-511, 1991.

Digital Library

Google Scholar

[19]

N. Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the A CM, 31:114-127, 1984.

Digital Library

Google Scholar

[20]

R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. In Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 8-13, 1989.

Digital Library

Google Scholar

[21]

J. Matouiek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. In Proc. 8. A CM Symposium on Computational Geometry, pages 1-8, 1992.

Digital Library

Google Scholar

[22]

J. Matouiek, E. Welzl, and L. Wernisch. Discrepancy and e-approximations for bounded VC-dimension. Combinatorica, 1992. To appear; also in Proc. 32. IEEE Symposium on Foundations of Computer Science (1991), pages 424-430.

Digital Library

Google Scholar

[23]

M. J. Post. Minimum spanning ellipsoids. In Proc. 16. A CM Symposium on Theory of Computing, pages 108-116, 1984.

Digital Library

Google Scholar

[24]

J. Renegar. On the computational complexity and geometry of the first order theory of the reals. Journal of Symbolic Computation, 1992.

Digital Library

Google Scholar

[25]

N. Sauer. On the density of families of sets. Journal of Combinatorial Theory Set. A, 13:145-147, 1972.

Google Scholar

[26]

R. Seidel. Small dimensional linear programming and convex hulls made easy. Discrete f_4 Computational Geometry, 6(5):423-434, 1991.

Crossref

Google Scholar

[27]

J. Spencer. Ten lectures on the probabilistic method. CBMS-NSF, SIAM, 1987.

Google Scholar

[28]

M. Sharir and E. Welzl. A combinatorial bound for linear programming and related problems. In Proc. 1992 Symposium on Theoretical Aspects of Computer Science (Lecture Notes in Computer Science), volume 577, pages 569-579. Springer-Verlag, 1992.

Digital Library

Google Scholar

[29]

V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl., 16:264-280, 1971.

Google Scholar

[30]

E. Welzl. SmMlest enclosing disks (balls and ellipsoids). In H. Maurer, editor, LNCS 555 (New Results and New Trends in Computer Science), pages 359-370. Springer-Verlag, 1991.

Google Scholar

[31]

E. Welzl. New results on linear programming and related problems (survey paper). Manuscript, 1992.

Google Scholar

[32]

F. F. Yao and A. C. Yao. A general approach to geometric queries. In Proc. 17. A CM Symposium on Theory of Computing, pages 163-168, 1985.

Digital Library

Google Scholar

Cited By

View all

Grauman KLearned-Miller ETorralba AZisserman A(2017)Guest EditorialIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2017.266385939:4(625-626)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1109/TPAMI.2017.2663859
Chin TPurkait PEriksson ASuter D(2017)Efficient Globally Optimal Consensus Maximisation with Tree SearchIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2016.263153139:4(758-772)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1109/TPAMI.2016.2631531
Gandhi SSuri SWelzl E(2010)Catching elephants with miceACM Transactions on Sensor Networks10.1145/1653760.16537616:1(1-27)Online publication date: 5-Jan-2010
https://dl.acm.org/doi/10.1145/1653760.1653761
Show More Cited By

Index Terms

On linear-time deterministic algorithms for optimization problems in fixed dimension
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization
  2. Randomness, geometry and discrete structures

Recommendations

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

In its simplest form, the longest common substring problem is to find a longest substring common to two or multiple strings. Using (generalized) suffix trees, this problem can be solved in linear time and space. A first generalization is the k -common ...
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

In its simplest form, the longest common substring problem is to find a longest substring common to two or multiple strings. Using (generalized) suffix trees, this problem can be solved in linear time and space. A first generalization is the k-common ...
High-Dimension optimization problems using specified particle swarm optimization
ICSI'12: Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I

Particle Swarm Optimization (PSO), proposed by Dr. J. Kennedy and Professor R. Eberhart in 1995, attracts many attentions to solve for a lot of real uni-modal/multi-modal optimization problems. Due to its simplicity of parametersetting and computational ...

Comments

Information & Contributors

Information

Published In

SODA '93: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms

January 1993

506 pages

ISBN:0898713137

Chairman:
Vijaya Ramachandran

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1993

Check for updates

Qualifiers

Article

Conference

SODA93

Sponsor:

SIGACT
SIAM

SODA93: Conference on Discrete Algorithms

January 25 - 27, 1993

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
401
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)4

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Grauman KLearned-Miller ETorralba AZisserman A(2017)Guest EditorialIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2017.266385939:4(625-626)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1109/TPAMI.2017.2663859
Chin TPurkait PEriksson ASuter D(2017)Efficient Globally Optimal Consensus Maximisation with Tree SearchIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2016.263153139:4(758-772)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1109/TPAMI.2016.2631531
Gandhi SSuri SWelzl E(2010)Catching elephants with miceACM Transactions on Sensor Networks10.1145/1653760.16537616:1(1-27)Online publication date: 5-Jan-2010
https://dl.acm.org/doi/10.1145/1653760.1653761
Gandhi SSuri SWelzl EJha S(2007)Catching elephants with miceProceedings of the 5th international conference on Embedded networked sensor systems10.1145/1322263.1322289(261-274)Online publication date: 6-Nov-2007
https://dl.acm.org/doi/10.1145/1322263.1322289
Pellegrini MKosaraju S(2001)Randomizing combinatorial algorithms for linear programming when the dimension is moderately highProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365425(101-108)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365425
Chan TSaks M(1997)Deterministic algorithms for 2-d convex programming and 3-d online linear programmingProceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms10.5555/314161.314345(464-472)Online publication date: 5-Jan-1997
https://dl.acm.org/doi/10.5555/314161.314345
Ramos EBoissonnat J(1997)Construction of 1-d lower envelopes and applicationsProceedings of the thirteenth annual symposium on Computational geometry10.1145/262839.262864(57-66)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/262839.262864
Porkolab LKhachiyan L(1997)On the Complexity of Semidefinite ProgramsJournal of Global Optimization10.1023/A:100820390334110:4(351-365)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1023/A%3A1008203903341
Goodrich MTardos É(1996)Fixed-dimensional parallel linear programming via relative ε-approximationsProceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/313852.313904(132-141)Online publication date: 28-Jan-1996
https://dl.acm.org/doi/10.5555/313852.313904
Sen SBlelloch G(1996)Parallel multidimensional search using approximation algorithmsProceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures10.1145/237502.237564(251-260)Online publication date: 24-Jun-1996
https://dl.acm.org/doi/10.1145/237502.237564
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

High-Dimension optimization problems using specified particle swarm optimization

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

High-Dimension optimization problems using specified particle swarm optimization

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations