Search results for "Max-clique"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
57	Federico Heras, Javier Larrosa	A Max-SAT Inference-Based Pre-processing for Max-Clique.	SAT	2008	DBLP DOI BibTeX RDF	Max-clique, Inference, Max-SAT
49	David Zuckerman	Linear degree extractors and the inapproximability of max clique and chromatic number.	STOC	2006	DBLP DOI BibTeX RDF	approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction
36	Hailong Yao, Yici Cai, Qiang Zhou 0001, Xianlong Hong	Crosstalk-Aware Routing Resource Assignment.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	track/layer assignment, routing, VLSI, interconnect, physical design, crosstalk
31	Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos	Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms.	WADS	2009	DBLP DOI BibTeX RDF
31	Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov	Solution and Optimization of Systems of Pseudo-Boolean Constraints.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT)
31	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Generic ILP versus specialized 0-1 ILP: an update.	ICCAD	2002	DBLP DOI BibTeX RDF
30	Federico Della Croce, Andrea Grosso, Marco Locatelli 0001	A heuristic approach for the max-min diversity problem based on max-clique.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
28	Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Rizzo	Parallel shared memory strategies for ant-based optimization algorithms.	GECCO	2009	DBLP DOI BibTeX RDF	Max Clique, ant-based algorithms, MPI, shared memory, OpenMP, distributed memory
28	Johan Håstad	Clique is Hard to Approximate Within n1-epsilon.	FOCS	1996	DBLP DOI BibTeX RDF	Max Clique approximation, amortized free bits, global function, local functions, local consistency conditions, computational complexity, polynomial time, proof system
28	Kihong Park, Bob Carter	On the effectiveness of genetic search in combinatorial optimization.	SAC	1995	DBLP DOI BibTeX RDF	max-clique, genetic algorithm, simulated annealing, combinatorial optimization
28	Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001	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
22	Johan Håstad	Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?	ICALP	2000	DBLP DOI BibTeX RDF
22	Lars Engebretsen, Jonas Holmerin	Clique Is Hard to Approximate within n1-o(1).	ICALP	2000	DBLP DOI BibTeX RDF
21		Constant factor approximation of MAX CLIQUE.	CoRR	2019	DBLP BibTeX RDF
21	Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé	EPTAS for Max Clique on Disks and Unit Balls.	CoRR	2018	DBLP BibTeX RDF
21	Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé	EPTAS for Max Clique on Disks and Unit Balls.	FOCS	2018	DBLP DOI BibTeX RDF
21	Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe	MILP and Max-Clique based heuristics for the Eternity II puzzle.	CoRR	2017	DBLP BibTeX RDF
21	Chaya Keller, Shakhar Smorodinsky, Gábor Tardos	On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers.	SODA	2017	DBLP DOI BibTeX RDF
21	Michael Codish, Michael Frank 0002, Amit Metodi, Morad Muslimany	Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description).	ICLP (Technical Communications)	2017	DBLP DOI BibTeX RDF
21	Roberto Battiti, Franco Mascia	Reactive and dynamic local search for max-clique: Engineering effective building blocks.	Comput. Oper. Res.	2010	DBLP DOI BibTeX RDF
21	Yan Xie, Philip S. Yu	Max-Clique: A Top-Down Graph-Based Approach to Frequent Pattern Mining.	ICDM	2010	DBLP DOI BibTeX RDF
21	David Zuckerman	Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number.	Theory Comput.	2007	DBLP DOI BibTeX RDF
21	David Zuckerman	Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
21	Oleg Verbitsky 0001	On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE.	Comb. Probab. Comput.	1995	DBLP DOI BibTeX RDF
21	Matthias Middendorf, Frank Pfeiffer	The max clique problem in classes of string-graphs.	Discret. Math.	1992	DBLP DOI BibTeX RDF
21	Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri	A Note on the Approximation of the MAX CLIQUE Problem.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF
14	Emma Rollon, Javier Larrosa	Mini-bucket Elimination with Bucket Propagation.	CP	2006	DBLP DOI BibTeX RDF
14	L. Sunil Chandran, Naveen Sivadasan	Geometric Representation of Graphs in Low Dimension.	COCOON	2006	DBLP DOI BibTeX RDF
14	Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri	Approximating the Maximum Isomorphic Agreement Subtree Is Hard.	CPM	2000	DBLP DOI BibTeX RDF