Search results for "Max-Cut"

Found 10 publication records. Showing 10 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Emely Arráiz, Oswaldo Olivo	Competitive simulated annealing and Tabu Search algorithms for the max-cut problem.	GECCO	2009	DBLP DOI BibTeX RDF	algorithms, simulated annealing, Tabu Search, metaheuristic, max-cut
1	Ryan O'Donnell, Yi Wu	An optimal sdp algorithm for max-cut, and equally optimal long code tests.	STOC	2008	DBLP DOI BibTeX RDF	semidefinite programming, hardness of approximation, max-cut
1	Alain Billionnet, Sourour Elloumi	Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem.	Math. Program.	2007	DBLP DOI BibTeX RDF	Quadratic 0-1 optimization, Convex quadratic relaxation, Semidefinite positive relaxation, Experiments, Integer programming, Max-cut
1	Abraham Duarte, Ángel Sánchez, Felipe Fernández, Raúl Cabido	A low-level hybridization between memetic algorithm and VNS for the max-cut problem.	GECCO	2005	DBLP DOI BibTeX RDF	evolutionary algorithms, metaheuristic, memetic algorithms, max-cut, VNS
1	Hua Xiang, Kai-Yuan Chao, Martin D. F. Wong	Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer.	ISQED	2005	DBLP DOI BibTeX RDF	Layer migration, Max-cut, Capacitance coupling
1	Piotr Berman, Marek Karpinski	On Some Tighter Inapproximability Results (Extended Abstract).	ICALP	1999	DBLP DOI BibTeX RDF	Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
1	Daya Ram Gaur, Ramesh Krishnamurti	Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.	ISAAC	1999	DBLP DOI BibTeX RDF	hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut
1	Mihir Bellare, Oded Goldreich, Madhu Sudan	Free Bits, PCPs and Non-Approximability - Towards Tight Results.	FOCS	1995	DBLP DOI BibTeX RDF	free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability
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
1	Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy	Proof Verification and Hardness of Approximation Problems	FOCS	1992	DBLP DOI BibTeX RDF	approximation problems, polynomial-time probabilistic oracle machine, random bits, MAXSNP-hard, metric TSP, time complexity, NP, MAX-CUT, MAX-SAT, proof verification