The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase max-bisection (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995-2004 (15) 2005-2017 (15) 2020-2022 (4)
Publication types (Num. hits)
article(20) inproceedings(14)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 16 occurrences of 14 keywords

Results
Found 34 publication records. Showing 34 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
103Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
73Jonas Holmerin, Subhash Khot A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF max-bisection, hardness of approximation, linear equations, PCPs
66Eran Halperin, Uri Zwick A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Josep Díaz, Marcin Kaminski 0001 MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Josep Díaz, Marcin Kaminski 0001 Max-Cut and Max-Bisection are NP-hard on unit disk graphs Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
35Alan M. Frieze, Mark Jerrum Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Search on Bibsonomy Algorithmica The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
35Alan M. Frieze, Mark Jerrum Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Search on Bibsonomy IPCO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
33Alexander D. Scott, Gregory B. Sorkin An LP-Designed Algorithm for Constraint Satisfaction. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Giulia Galbiati, Francesco Maffioli Approximating Maximum Cut with Limited Unbalance. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithm, randomized algorithm, semidefinite programming
31Sanjeev Mahajan, Ramesh Hariharan Derandomizing Semidefinite Programming Based Approximation Algorithms. Search on Bibsonomy FOCS The full citation details ... 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
28Ai-fan Ling Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Rong-Qiang Zeng, Matthieu Basseur Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. Search on Bibsonomy ICIC (1) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
26Shicong Jiang, Chuangyin Dang A more efficient deterministic annealing neural network algorithm for the max-bisection problem. Search on Bibsonomy Neurocomputing The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
26Hauke 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. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
26Qilong Feng, Senmin Zhu, Jianxin Wang 0001 An improved kernel for Max-Bisection above tight lower bound. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
26Qilong Feng, Senmin Zhu, Jianxin Wang 0001 A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound. Search on Bibsonomy COCOON The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
26Per Austrin, Siavosh Benabbas, Konstantinos Georgiou Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
26Zi Xu, Donglei Du, Dachuan Xu Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
26Qinghua Wu 0002, Jin-Kao Hao Memetic search for the max-bisection problem. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
26Dongping Tian, Wenbo Zhang, Xiaofei Zhao, Zhongzhi Shi Employing PLSA model and max-bisection for refining image annotation. Search on Bibsonomy ICIP The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
26Per Austrin, Siavosh Benabbas, Konstantinos Georgiou Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
26Per Austrin, Siavosh Benabbas, Konstantinos Georgiou Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
26Fengmin Xu, Xusheng Ma, Baili Chen A new Lagrangian net algorithm for solving max-bisection problems. Search on Bibsonomy J. Comput. Appl. Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
26Fengmin Xu, Chengxian Xu, Honggang Xue A multiple penalty function method for solving Max-Bisection problems. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2004 DBLP  BibTeX  RDF
26Chuangyin Dang, Liping He, Ip Kee Hui A deterministic annealing algorithm for approximating a solution of the max-bisection problem. Search on Bibsonomy Neural Networks The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Uriel Feige, Marek Karpinski, Michael Langberg A note on approximating Max-Bisection on regular graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Yinyu Ye 0001 A .699-approximation algorithm for Max-Bisection. Search on Bibsonomy Math. Program. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Uriel Feige, Marek Karpinski, Michael Langberg A Note on Approximating MAX-BISECTION on Regular Graphs Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
26Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
26Klaus Jansen, Marek Karpinski, Andrzej Lingas A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
22Uriel Feige, Michael Langberg The RPR2 Rounding Technique for Semidefinite Programs. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Gunnar Andersson An Approximation Algorithm for Max p-Section. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #34 of 34 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license