Search results for "Max-Bisection"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
103	Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.	STACS	2001	DBLP DOI BibTeX RDF
73	Jonas Holmerin, Subhash Khot	A new PCP outer verifier with applications to homogeneous linear equations and max-bisection.	STOC	2004	DBLP DOI BibTeX RDF	max-bisection, hardness of approximation, linear equations, PCPs
66	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
35	Josep Díaz, Marcin Kaminski 0001	MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
35	Josep Díaz, Marcin Kaminski 0001	Max-Cut and Max-Bisection are NP-hard on unit disk graphs	CoRR	2006	DBLP BibTeX RDF
35	Alan M. Frieze, Mark Jerrum	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.	Algorithmica	1997	DBLP DOI BibTeX RDF
35	Alan M. Frieze, Mark Jerrum	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.	IPCO	1995	DBLP DOI BibTeX RDF
33	Alexander D. Scott, Gregory B. Sorkin	An LP-Designed Algorithm for Constraint Satisfaction.	ESA	2006	DBLP DOI BibTeX RDF
33	Giulia Galbiati, Francesco Maffioli	Approximating Maximum Cut with Limited Unbalance.	WAOA	2006	DBLP DOI BibTeX RDF	approximation algorithm, randomized algorithm, semidefinite programming
31	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
28	Ai-fan Ling	Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation.	COCOA	2009	DBLP DOI BibTeX RDF
26	Rong-Qiang Zeng, Matthieu Basseur	Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem.	ICIC (1)	2022	DBLP DOI BibTeX RDF
26	Shicong Jiang, Chuangyin Dang	A more efficient deterministic annealing neural network algorithm for the max-bisection problem.	Neurocomputing	2021	DBLP DOI BibTeX RDF
26	Hauke Brinkop, Klaus Jansen, Tim Weißenfels	An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv.	CoRR	2021	DBLP BibTeX RDF
26	Qilong Feng, Senmin Zhu, Jianxin Wang 0001	An improved kernel for Max-Bisection above tight lower bound.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
26	Qilong Feng, Senmin Zhu, Jianxin Wang 0001	A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound.	COCOON	2017	DBLP DOI BibTeX RDF
26	Per Austrin, Siavosh Benabbas, Konstantinos Georgiou	Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection.	ACM Trans. Algorithms	2016	DBLP DOI BibTeX RDF
26	Zi Xu, Donglei Du, Dachuan Xu	Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems.	J. Comb. Optim.	2014	DBLP DOI BibTeX RDF
26	Qinghua Wu 0002, Jin-Kao Hao	Memetic search for the max-bisection problem.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
26	Dongping Tian, Wenbo Zhang, Xiaofei Zhao, Zhongzhi Shi	Employing PLSA model and max-bisection for refining image annotation.	ICIP	2013	DBLP DOI BibTeX RDF
26	Per Austrin, Siavosh Benabbas, Konstantinos Georgiou	Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection.	SODA	2013	DBLP DOI BibTeX RDF
26	Per Austrin, Siavosh Benabbas, Konstantinos Georgiou	Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection	CoRR	2012	DBLP BibTeX RDF
26	Fengmin Xu, Xusheng Ma, Baili Chen	A new Lagrangian net algorithm for solving max-bisection problems.	J. Comput. Appl. Math.	2011	DBLP DOI BibTeX RDF
26	Fengmin Xu, Chengxian Xu, Honggang Xue	A multiple penalty function method for solving Max-Bisection problems.	Appl. Math. Comput.	2006	DBLP DOI BibTeX RDF
26	Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
26	Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas	Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.	Fundam. Informaticae	2004	DBLP BibTeX RDF
26	Chuangyin Dang, Liping He, Ip Kee Hui	A deterministic annealing algorithm for approximating a solution of the max-bisection problem.	Neural Networks	2002	DBLP DOI BibTeX RDF
26	Uriel Feige, Marek Karpinski, Michael Langberg	A note on approximating Max-Bisection on regular graphs.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
26	Yinyu Ye 0001	A .699-approximation algorithm for Max-Bisection.	Math. Program.	2001	DBLP DOI BibTeX RDF
26	Uriel Feige, Marek Karpinski, Michael Langberg	A Note on Approximating MAX-BISECTION on Regular Graphs	Electron. Colloquium Comput. Complex.	2000	DBLP BibTeX RDF
26	Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas	Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs	Electron. Colloquium Comput. Complex.	2000	DBLP BibTeX RDF
26	Klaus Jansen, Marek Karpinski, Andrzej Lingas	A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs	Electron. Colloquium Comput. Complex.	2000	DBLP BibTeX RDF
22	Uriel Feige, Michael Langberg	The RPR2 Rounding Technique for Semidefinite Programs.	ICALP	2001	DBLP DOI BibTeX RDF
16	Gunnar Andersson	An Approximation Algorithm for Max p-Section.	STACS	1999	DBLP DOI BibTeX RDF