×

zbMATH — the first resource for mathematics

Found 114 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.
Maximum cuts in edge-colored graphs. (English) Zbl 1383.05122
Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 87-92 (2017).
MSC:  05C15 05C10 68Q25
PDF BibTeX XML Cite
\textit{R. Sucupira} et al., Electron. Notes Discrete Math. 62, 87--92 (2017; Zbl 1383.05122)
Full Text: DOI
Angel, Omer; Bubeck, Sébastien; Peres, Yuval; Wei, Fan
Local max-cut in smoothed polynomial time. (English) Zbl 1369.68226
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 429-437 (2017).
MSC:  68Q25 68T20 91A10
PDF BibTeX XML Cite
\textit{O. Angel} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 429--437 (2017; Zbl 1369.68226)
Full Text: DOI
Etscheid, Michael; Mnich, Matthias
Linear kernels and linear-time algorithms for finding large cuts. (English) Zbl 1398.68229
Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 31, 13 p. (2016).
MSC:  68Q25 05C85 68R10
PDF BibTeX XML Cite
\textit{M. Etscheid} and \textit{M. Mnich}, LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 31, 13 p. (2016; Zbl 1398.68229)
Full Text: DOI
Kogan, Dmitry; Krauthgamer, Robert
Sketching cuts in graphs and hypergraphs. (English) Zbl 1365.68469
Proceedings of the 6th conference on innovations in theoretical computer science, ITCS’15, Rehovot, Israel, January 11–13, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3333-7). 367-376 (2015).
MSC:  68W25 05C65 05C85 68Q25
PDF BibTeX XML Cite
\textit{D. Kogan} and \textit{R. Krauthgamer}, in: Proceedings of the 6th conference on innovations in theoretical computer science, ITCS'15, Rehovot, Israel, January 11--13, 2015. New York, NY: Association for Computing Machinery (ACM). 367--376 (2015; Zbl 1365.68469)
Full Text: DOI
Li, Li
Selected applications of convex optimization. (English) Zbl 1321.90005
Springer Optimization and Its Applications 103. Beijing: Tsinghua University Press; Berlin: Springer (ISBN 978-7-302-39029-9/pbk; 978-3-662-46355-0/pbk; 978-3-662-46356-7/ebook). x, 140 p. (2015).
Reviewer: Rembert Reemtsen (Cottbus)
MSC:  90-02 90C25 90C90 00A69
PDF BibTeX XML Cite
\textit{L. Li}, Selected applications of convex optimization. Beijing: Tsinghua University Press; Berlin: Springer (2015; Zbl 1321.90005)
Full Text: DOI
Crowston, Robert; Jones, Mark; Muciaccia, Gabriele; Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
Polynomial kernels for \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. (English) Zbl 1359.68125
Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 43-54 (2013).
MSC:  68Q25 05C60 05C85
PDF BibTeX XML Cite
\textit{R. Crowston} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 43--54 (2013; Zbl 1359.68125)
Full Text: DOI arXiv
Bondarenko, V. A.; Nikolaev, A. V.
Combinatorial and geometric properties of the max-cut and min-cut problems. (English. Russian original) Zbl 1291.90198
Dokl. Math. 88, No. 2, 516-517 (2013); translation from Dokl. Akad. Nauk. 452, No. 2, 127-129 (2013).
Reviewer: Václav Koubek (Praha)
MSC:  90C27 05C35 05C10 05C21 05C40 90C35
PDF BibTeX XML Cite
\textit{V. A. Bondarenko} and \textit{A. V. Nikolaev}, Dokl. Math. 88, No. 2, 516--517 (2013; Zbl 1291.90198); translation from Dokl. Akad. Nauk. 452, No. 2, 127--129 (2013)
Full Text: DOI
de Sousa, Samuel; Haxhimusa, Yll; Kropatsch, Walter G.
Estimation of distribution algorithm for the max-cut problem. (English) Zbl 1382.68235
Kropatsch, Walter G. (ed.) et al., Graph-based representations in pattern recognition. 9th IAPR-TC-15 international workshop, GbRPR 2013, Vienna, Austria, May 15–17, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38220-8/pbk). Lecture Notes in Computer Science 7877, 244-253 (2013).
MSC:  68T20 68R10 68U10
PDF BibTeX XML Cite
\textit{S. de Sousa} et al., Lect. Notes Comput. Sci. 7877, 244--253 (2013; Zbl 1382.68235)
Full Text: DOI
Guenin, Bertrand; Stuive, Leanne
Single commodity-flow algorithms for lifts of graphic and co-graphic matroids. (English) Zbl 1372.05030
Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 193-204 (2013).
MSC:  05B35 05C22 90C05 90C47 68Q25
PDF BibTeX XML Cite
\textit{B. Guenin} and \textit{L. Stuive}, Lect. Notes Comput. Sci. 7801, 193--204 (2013; Zbl 1372.05030)
Full Text: DOI
Lancia, Giuseppe; Serafini, Paolo
An effective compact formulation of the max cut problem on sparse graphs. (English) Zbl 1268.05204
Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 111-116 (2011).
MSC:  05C85
PDF BibTeX XML Cite
\textit{G. Lancia} and \textit{P. Serafini}, Electron. Notes Discrete Math. 37, 111--116 (2011; Zbl 1268.05204)
Full Text: DOI
Elsässer, Robert; Tscheuschner, Tobias
Settling the complexity of local max-cut (almost) completely. (English) Zbl 1332.68072
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 171-182 (2011).
MSC:  68Q25 68Q17 68R10
PDF BibTeX XML Cite
\textit{R. Elsässer} and \textit{T. Tscheuschner}, Lect. Notes Comput. Sci. 6755, 171--182 (2011; Zbl 1332.68072)
Full Text: DOI
Kamiński, Marcin
Max-Cut and containment relations in graphs. (English) Zbl 1309.05173
Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 15-26 (2010).
MSC:  05C85 05C10 05C62 05C83 68Q25
PDF BibTeX XML Cite
\textit{M. Kamiński}, Lect. Notes Comput. Sci. 6410, 15--26 (2010; Zbl 1309.05173)
Full Text: DOI
Xu, Fengmin; Xu, Chengxian
A continuous method for solving multiuser detection in CDMA. (English) Zbl 1120.90314
Megiddo, Nimrod (ed.) et al., Algorithmic applications in management. First international conference, AAIM 2005, Xian, China, June 22–25, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26224-5/pbk). Lecture Notes in Computer Science 3521, 311-319 (2005).
MSC:  90B18
PDF BibTeX XML Cite
\textit{F. Xu} and \textit{C. Xu}, Lect. Notes Comput. Sci. 3521, 311--319 (2005; Zbl 1120.90314)
Full Text: DOI
Dukanović, Igor
Rank-two relaxation heuristics for max-cut problem. (English) Zbl 1004.90054
Lenart, L. (ed.) et al., SOR ’01. Proceedings of the 6th international symposium on operational research in Slovenia, Preddvor, Slovenia, September 26-28, 2001. Ljubljana: Slovenian Society Informatika, Section for Operational Research. 59-64 (2001).
MSC:  90C27 90C59 90C53 90C90
PDF BibTeX XML Cite
\textit{I. Dukanović}, in: SOR '01. Proceedings of the 6th international symposium on operational research in Slovenia, Preddvor, Slovenia, September 26--28, 2001. Ljubljana: Slovenian Society Informatika, Section for Operational Research. 59--64 (2001; Zbl 1004.90054)
Alon, Noga; Sudakov, Benny; Zwick, Uri
Constructing worst case instances for semidefinite programming based approximation algorithms. (English) Zbl 1012.90034
Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 92-100 (2001).
MSC:  90C22 90C59
PDF BibTeX XML Cite
\textit{N. Alon} et al., in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 92--100 (2001; Zbl 1012.90034)
Anjos, Miguel F.; Wolkowicz, Henry
Strengthened semidefinite programming relaxations for the max-cut problem. (English) Zbl 1049.90051
Hadjisavvas, Nicolas (ed.) et al., Advances in convex analysis and global optimization. Honoring the memory of C. Caratheodory (1873-1950). Dordrecht: Kluwer Academic Publishers (ISBN 0-7923-6942-4). Nonconvex Optim. Appl. 54, 409-420 (2001).
MSC:  90C22 90C27 90C57 49M37
PDF BibTeX XML Cite
\textit{M. F. Anjos} and \textit{H. Wolkowicz}, Nonconvex Optim. Appl. 54, 409--420 (2001; Zbl 1049.90051)
Christof, Thomas
Low-dimensional 0/1-polytopes and branch-and-cut in combinatorial optimization. (English) Zbl 0911.90280
Heidelberg: Univ. Heidelberg, Naturwissenschaftlich-Mathematische Gesamtfakultät, 152 p. (1997).
Reviewer: R.Euler (Brest)
MSC:  90C27 52B12 92D20 90C09 90C06 90-02
PDF BibTeX XML Cite
\textit{T. Christof}, Low-dimensional 0/1-polytopes and branch-and-cut in combinatorial optimization. Heidelberg: Univ. Heidelberg, Naturwissenschaftlich-Mathematische Ge\-samt\-fa\-kul\-tät (1997; Zbl 0911.90280)
Mohar, Bojan
Some applications of Laplace eigenvalues of graphs. Notes taken by Martin Juvan. (English) Zbl 0883.05096
Hahn, Geňa (ed.) et al., Graph symmetry: algebraic methods and applications. Proceedings of the NATO Advanced Study Institute and séminaire de mathématiques supérieures, Montréal, Canada, July 1-12, 1996. Dordrecht: Kluwer Academic Publishers. NATO ASI Ser., Ser. C, Math. Phys. Sci. 497, 225-275 (1997).
Reviewer: D.Cvetković (Beograd)
MSC:  05C50 90C35 05-02
PDF BibTeX XML Cite
\textit{B. Mohar}, NATO ASI Ser., Ser. C, Math. Phys. Sci. 497, 225--275 (1997; Zbl 0883.05096)
Reinelt, Gerhard
Combinatorial optimization and VLSI-design. (Kombinatorische Optimierung und VLSI-Entwurf.) (German) Zbl 0908.90215
Bachem, Achim (ed.) et al., Mathematik in der Praxis. Fallstudien aus Industrie, Wirtschaft, Naturwissenschaften und Medizin. Ausarbeitungen der Vorträge der Tagung “Mathematik in Industrie und Wirtschaft”, März 1993, Köln/Germany. Berlin: Springer-Verlag. 237-260 (1995).
Reviewer: R.E.Burkard (Graz)
MSC:  90C27 90C60 90C35
PDF BibTeX XML Cite
\textit{G. Reinelt}, in: Mathematik in der Praxis. Fallstudien aus Industrie, Wirtschaft, Naturwissenschaften und Medizin. Ausarbeitungen der Vorträge der Tagung ``Mathematik in Industrie und Wirtschaft'', März 1993, Köln/Germany. Berlin: Springer-Verlag. 237--260 (1995; Zbl 0908.90215)
Poljak, S.
Polyhedral and eigenvalue approximations of the max-cut problem. (English) Zbl 0792.05102
Halász, G. (ed.) et al., Sets, graphs and numbers. A birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland Publishing Company. Colloq. Math. Soc. János Bolyai. 60, 569-581 (1992).
Reviewer: B.Mohar (Ljubljana)
MSC:  05C50 05C99 68R10 90C27
PDF BibTeX XML Cite
\textit{S. Poljak}, in: Sets, graphs and numbers. A birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland Publishing Company. 569--581 (1992; Zbl 0792.05102)

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
all top 3
Software