NDLI: Greedy MaxCut algorithms and their information content

Content Provider	IEEE Xplore Digital Library
Author	Yatao Bian Gronskiy, A. Buhmann, J.M.
Copyright Year	2015
Description	Author affiliation: Dept. of Comput. Sci., ETH Zurich, Zurich, Switzerland (Yatao Bian; Gronskiy, A.; Buhmann, J.M.)
Abstract	MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem. Applications of MAXCUT are abundant in machine learning, computer vision and statistical physics. Greedy algorithms to approximately solve MAXCUT rely on greedy vertex labelling or on an edge contraction strategy. These algorithms have been studied by measuring their approximation ratios in the worst case setting but very little is known to characterize their robustness to noise contaminations of the input data in the average case. Adapting the framework of Approximation Set Coding, we present a method to exactly measure the cardinality of the algorithmic approximation sets of five greedy MAXCUT algorithms. Their information contents are explored for graph instances generated by two different noise models: the edge reversal model and Gaussian edge weights model. The results provide insights into the robustness of different greedy heuristics and techniques for MAXCUT, which can be used for algorithm design of general USM problems.
Starting Page	1
Ending Page	5
File Size	726080
Page Count	5
File Format	PDF
ISBN	9781479955244
e-ISBN	9781479955268
DOI	10.1109/ITW.2015.7133122
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-26
Publisher Place	Israel
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Greedy algorithms Machine learning algorithms Noise Approximation algorithms Approximation methods Noise measurement
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations

Research on randomized greedy algorithm for k-median problem

The information content in sorting algorithms

Crowd-powered find algorithms

A Sharing-Aware Greedy Algorithm for Virtual Machine Maximization

Research on selecting initial points for k-means clustering

Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis

Sparse group covers and greedy tree approximations

Approximate Kernel Clustering

Greedy MaxCut algorithms and their information content

Similar Documents

Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations

Research on randomized greedy algorithm for k-median problem

The information content in sorting algorithms

Crowd-powered find algorithms

A Sharing-Aware Greedy Algorithm for Virtual Machine Maximization

Research on selecting initial points for k-means clustering

Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis

Sparse group covers and greedy tree approximations

Approximate Kernel Clustering

Greedy MaxCut algorithms and their information content