Search results for "Max-Bisection"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	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
2	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
1	Fengmin Xu, Xusheng Ma, Baili Chen	A new Lagrangian net algorithm for solving max-bisection problems.	J. Computational Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Ai-fan Ling	Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation.	COCOA	2009	DBLP DOI BibTeX RDF
1	Josep Díaz, Marcin Kaminski	MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Josep Díaz, Marcin Kaminski	Max-Cut and Max-Bisection are NP-hard on unit disk graphs	CoRR	2006	DBLP BibTeX RDF
1	Fengmin Xu, Chengxian Xu, Honggang Xue	A multiple penalty function method for solving Max-Bisection problems.	Applied Mathematics and Computation	2006	DBLP DOI BibTeX RDF
1	Alexander D. Scott, Gregory B. Sorkin	An LP-Designed Algorithm for Constraint Satisfaction.	ESA	2006	DBLP DOI BibTeX RDF
1	Giulia Galbiati, Francesco Maffioli	Approximating Maximum Cut with Limited Unbalance.	WAOA	2006	DBLP DOI BibTeX RDF	approximation algorithm, randomized algorithm, semidefinite programming
1	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
1	Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas	Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.	Fundam. Inform.	2004	DBLP BibTeX RDF
1	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
1	Uriel Feige, Marek Karpinski, Michael Langberg	A note on approximating Max-Bisection on regular graphs.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
1	Uriel Feige, Michael Langberg	The RPR2 Rounding Technique for Semidefinite Programs.	ICALP	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
1	Uriel Feige, Marek Karpinski, Michael Langberg	A Note on Approximating MAX-BISECTION on Regular Graphs	Electronic Colloquium on Computational Complexity (ECCC)	2000	DBLP BibTeX RDF
1	Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas	Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs	Electronic Colloquium on Computational Complexity (ECCC)	2000	DBLP BibTeX RDF
1	Klaus Jansen, Marek Karpinski, Andrzej Lingas	A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs	Electronic Colloquium on Computational Complexity (ECCC)	2000	DBLP BibTeX RDF
1	Gunnar Andersson	An Approximation Algorithm for Max p-Section.	STACS	1999	DBLP DOI BibTeX RDF
1	Alan M. Frieze, Mark Jerrum	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.	Algorithmica	1997	DBLP DOI BibTeX RDF
1	Alan M. Frieze, Mark Jerrum	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.	IPCO	1995	DBLP DOI BibTeX RDF
1	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