A note on approximating Max-Bisection on regular graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A note on approximating Max-Bisection on regular graphs

Published:2001-08 Issue:4 Volume:79 Page:181-188
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Feige Uriel,Karpinski Marek,Langberg Michael

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. On some tighter inapproximability results, further improvements;Berman,1998

2. The number of matchings in random graphs and bipartite graphs;Bollobás;J. Combin. Theory Ser. B,1986

3. Improved approximation algorithms for Max-k-Cut and Max-Bisection;Frieze;Algorithmica,1997

4. Improved approximation of Max-Cut on graphs of bounded degree;Feige,2000

5. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming;Goemans;J. ACM,1995

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation and Complexity of the Capacitated Geometric Median Problem;Computer Science – Theory and Applications;2021

2. An improved kernel for Max-Bisection above tight lower bound;Theoretical Computer Science;2020-05

3. A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound;Lecture Notes in Computer Science;2017

4. Better Balance by Being Biased;ACM Transactions on Algorithms;2016-12-21

5. An Edge-Set Representation Based on a Spanning Tree for Searching Cut Space;IEEE Transactions on Evolutionary Computation;2015-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP