Search results for "NP-hard problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov	On Two Techniques of Combining Branching and Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms
2	Jiong Guo, Rolf Niedermeier	Linear Problem Kernels for NP-Hard Problems on Planar Graphs.	ICALP	2007	DBLP DOI BibTeX RDF
2	Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch	Measure and conquer: a simple O(20.288n) independent set algorithm.	SODA	2006	DBLP DOI BibTeX RDF	exponential-time exact algorithms, independent set problem, NP-hard problems, algorithms and data structures
2	Juan Frausto Solís, Héctor Sanvicente Sánchez, Froilán Imperial-Valenzuela	ANDYMARK: An Analytical Method to Establish Dynamically the Length of the Markov Chain in Simulated Annealing for the Satisfiability Problem.	SEAL	2006	DBLP DOI BibTeX RDF	Optimization, Heuristics, Simulated Annealing, Combinatorial Optimization, Satisfiability, NP-Hard Problems
2	Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia	Tight Lower Bounds for Certain Parameterized NP-Hard Problems.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
2	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	Linear FPT reductions and computational lower bounds.	STOC	2004	DBLP DOI BibTeX RDF	lower bound, complexity theory, NP-hard problems
2	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Graph modification, Search tree algorithms, Automated development and analysis of algorithms, Exact algorithms, NP-hard problems, Algorithm engineering
2	Nicolas J. Cerf, Lov K. Grover, Colin P. Williams	Nested Quantum Search and NP-Hard Problems.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Combinatorial search problems, Quantum computation, NP-hard problems, Quantum algorithms
2	Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay	DNA Models and Algorithms for NP-complete Problems. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
2	Ira Pramanick, Jon G. Kuhl	An Inherently Parallel Method for Heuristic Problem-Solving: Part I-General Framework.	IEEE Trans. Parallel Distrib. Syst.	1995	DBLP DOI BibTeX RDF	heuristic problem solving, dynamic interaction, locally applied heuristics, NP-hard problems, inherently parallel
1	Roman V. Yampolskiy, Ahmed El-Barkouky	Wisdom of artificial crowds algorithm for solving NP-hard problems.	IJBIC	2011	DBLP DOI BibTeX RDF
1	Christian Glaßer, Aduri Pavan, Stephen D. Travers	The fault tolerance of NP-hard problems.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	José Manuel Lanza-Gutiérrez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez, Juan M. Sanchez	A multi-objective network design for real traffic models of the internet by means of a parallel framework for solving NP-hard problems.	NaBIC	2011	DBLP DOI BibTeX RDF
1	Phillip A. Laplante	Ender Wiggin Played Mafia Wars Too.	IT Professional	2011	DBLP DOI BibTeX RDF	surreptitious problem solving, social networks, information technology, NP-complete problems, NP-hard problems, crowdsourcing, Gameplay
1	Eyal Cohen, Shlomi Dolev, Sergey Frenkel, Rami Puzis, Michael Rosenblit	Nanotechnology Based Optical Solution for NP-Hard Problems.	OSC	2010	DBLP DOI BibTeX RDF
1	Senjuti Basu Roy, Sihem Amer-Yahia, Ashish Chawla, Gautam Das, Cong Yu	Constructing and exploring composite items.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	composite item construction, np-hard problems, e-commerce application
1	Mahboobeh Houshmand, Elaheh Soleymanpour, Hossein Salami, Mahya Amerian, Hossein Deldari	Efficient Scheduling of Task Graphs to Multiprocessors Using a Combination of Modified Simulated Annealing and List Based Scheduling.	IITSI	2010	DBLP DOI BibTeX RDF	List based scheduling algorithms, modified simulated annealing, task scheduling problem, NP hard problems
1	He Jiang, Yudong Chen	An efficient algorithm for generalized minimum spanning tree problem.	GECCO	2010	DBLP DOI BibTeX RDF	candidate set, generalized minimum spanning tree, local search
1	He Jiang, Jifeng Xuan, Zhilei Ren	Approximate backbone based multilevel algorithm for next release problem.	GECCO	2010	DBLP DOI BibTeX RDF	approximate backbone, multilevel algorithm, next release problem (nrp), requirement engineering
1	Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità	An improved LP-based approximation for steiner tree.	STOC	2010	DBLP DOI BibTeX RDF	approximation algorithms, randomized algorithms, network design, linear programming relaxations
1	Michael Gnewuch, Anand Srivastav, Carola Winzen	Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems.	J. Complexity	2009	DBLP DOI BibTeX RDF
1	Christian Glaßer, Aduri Pavan, Stephen D. Travers	The Fault Tolerance of NP-Hard Problems.	LATA	2009	DBLP DOI BibTeX RDF
1	Sarvesh Kumar Varatharajan, Gunes Ercal-Ozkaya	On a Local Heuristic for a Reverse Multicast Forwarding Game.	NetCoM	2009	DBLP DOI BibTeX RDF	incentive compatible topology control, heuristics for NP-Hard problems, random Euclidean power graphs, sensor networks, game theory, local algorithm, location based routing
1	Lasse Kliemann, Anand Srivastav	Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.	SEA	2009	DBLP DOI BibTeX RDF	hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding
1	Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch	A measure & conquer approach for the analysis of exact algorithms.	J. ACM	2009	DBLP DOI BibTeX RDF	Dominating set, exact algorithm, independent set
1	Matthew Andrews, Lisa Zhang	Complexity of wavelength assignment in optical network optimization.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	approximation algorithms, optical networking, hardness of approximation, routing and wavelength assignment
1	Ali Asghar Pourhaji Kazem, Habib Seifzadeh, Mehdi Kargahi, Ali Movaghar-Rahimabadi, Shahriar Lotfi	Maximizing the Accrued Utility of an Isochronal Soft Real-Time System Using Genetic Algorithms.	ACIS-ICIS	2009	DBLP DOI BibTeX RDF
1	Avner Magen, Mohammad Moharrami	Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Valentina Ciriani, Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati	Keep a Few: Outsourcing Data While Maintaining Confidentiality.	ESORICS	2009	DBLP DOI BibTeX RDF
1	Óscar Ibáñez, Oscar Cordón, Sergio Damas, Luis Magdalena	A Review on the Application of Hybrid Artificial Intelligence Systems to Optimization Problems in Operations Management.	HAIS	2009	DBLP DOI BibTeX RDF	hybrid artificial intelligence systems, assembly line balancing, dynamic scheduling, process planning, design engineering, operations management
1	Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis	Efficient Methods for Selfish Network Design.	ICALP	2009	DBLP DOI BibTeX RDF
1	María Luisa Pérez-Delgado, J. Escuadra Burrieza	A Post-optimization Method to Improve the Ant Colony System Algorithm.	IWANN	2009	DBLP DOI BibTeX RDF	Dynamic Programming, Traveling Salesman Problem, Ant Colony System
1	Robert Ganian, Petr Hlinený	Better Polynomial Algorithms on Graphs of Bounded Rank-Width.	IWOCA	2009	DBLP DOI BibTeX RDF	Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number
1	Jianer Chen, Iyad A. Kanj, Ge Xia	On Parameterized Exponential Time Complexity.	TAMC	2009	DBLP DOI BibTeX RDF
1	Samuel Burer	On the copositive representation of binary and continuous nonconvex quadratic programs.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C25, 90C26, 90C20
1	Parthasarathy Guturu, Ram Dantu	An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding.	IEEE Transactions on Systems, Man, and Cybernetics, Part B	2008	DBLP DOI BibTeX RDF
1	Paul Cockshott, Andreas Koltes, John T. O'Donnell, Patrick Prosser, Wim Vanderbauwhede	A Hardware Relaxation Paradigm for Solving NP-Hard Problems.	BCS Int. Acad. Conf.	2008	DBLP BibTeX RDF
1	Bin Chen, Guangri Quan	NP-Hard Problems of Learning from Examples.	FSKD	2008	DBLP DOI BibTeX RDF
1	Jittat Fakcharoenphol, Bundit Laekhanukit	An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design
1	Robert W. Irving, David Manlove	Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Weak stability, Approximation algorithms, NP-hard problems, Stable matching
1	Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi	Fully polynomial time approximation schemes for stochastic dynamic programs.	SODA	2008	DBLP DOI BibTeX RDF
1	Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer	What can be approximated locally?: case study: dominating sets in planar graphs.	SPAA	2008	DBLP DOI BibTeX RDF	distributed algorithms, approximation, planar graphs, local algorithms, dominating sets
1	Daniel Berend, Steven Skiena, Yochai Twitto	Combinatorial dominance guarantees for problems with infeasible solutions.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Computation complexity, approximation algorithms, algorithms analysis, dominance analysis
1	Harry Buhrman, John M. Hitchcock	NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	hard sets, polynomial advice, instance complexity
1	Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit	On the solvability of the localization problem in robot networks.	ICRA	2008	DBLP DOI BibTeX RDF
1	Xiang Luo, Koushik Kar, Sambit Sahu, Prashant Pradhan, Anees Shaikh	On Improving Change Management Process for Enterprise IT Services.	IEEE SCC	2008	DBLP DOI BibTeX RDF	change scheduling, enterprise IT services, Change management
1	Zongwu Ke, Layuan Li, Nianshen Chen	A Crossover Game Routing Algorithm for Wireless Multimedia Sensor Networks.	SNPD	2008	DBLP DOI BibTeX RDF	QoS, Routing, Game Theory, Nash Equilibrium, GA
1	Jin Xiao-shan, Li Jun, Jing Ning	On Relaxing and Steady State Genetic Methods for Satellite Imaging Scheduling.	SNPD	2008	DBLP DOI BibTeX RDF
1	Chin-Chia Jane, Yih-Wenn Laih	A Practical Algorithm for Computing Multi-State Two-Terminal Reliability.	IEEE Transactions on Reliability	2008	DBLP DOI BibTeX RDF
1	David R. Karger, Jacob Scott	Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
1	Ruzica Piskac, Viktor Kuncak	Linear Arithmetic with Stars.	CAV	2008	DBLP DOI BibTeX RDF
1	Jianxin Wang, Qilong Feng	Improved Parameterized Algorithms for Weighted 3-Set Packing.	COCOON	2008	DBLP DOI BibTeX RDF
1	Maria Belén Vaquerizo García	Generating Routes with Bio-inspired Algorithms under Uncertainty.	HAIS	2008	DBLP DOI BibTeX RDF	Collective Urban Public Transport, Routes Generator, Fuzzy Demand, Triangular Fuzzy Numbers, Ant Colony Optimization, Combinatorial Complexity
1	Yossi Azar, Iftah Gamzu	Truthful Unification Framework for Packing Integer Programs with Choices.	ICALP	2008	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin	On Problems without Polynomial Kernels (Extended Abstract).	ICALP	2008	DBLP DOI BibTeX RDF
1	Joaquín Pérez, Laura Cruz, Rodolfo A. Pazos, Vanesa Landero N., Gerardo Reyes Salgado, José Crispín Zavala Díaz, Héctor J. Fraire H., Verónica Pérez	A Causal Approach for Explaining Why a Heuristic Algorithm Outperforms Another in Solving an Instance Set of the Bin Packing Problem.	ISMIS	2008	DBLP DOI BibTeX RDF
1	Martin Fürer	Solving NP-Complete Problems with Quantum Search.	LATIN	2008	DBLP DOI BibTeX RDF
1	Dominik Scheder	Guided Search and a Faster Deterministic Algorithm for 3-SAT.	LATIN	2008	DBLP DOI BibTeX RDF
1	Yu-Liang Kuo, Chia-Cheng Hu, Chun-Yuan Chiu	Maximum Traffic Routing Problems in Wireless Mesh Networks.	PCM	2008	DBLP DOI BibTeX RDF
1	Jianxin Wang, Qilong Feng	An O*(3.523k) Parameterized Algorithm for 3-Set Packing.	TAMC	2008	DBLP DOI BibTeX RDF
1	Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh	Degree-Constrained Subgraph Problems: Hardness and Approximation Results.	WAOA	2008	DBLP DOI BibTeX RDF	Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
1	Zhengbing Bian, Qian-Ping Gu	Computing Branch Decomposition of Large Planar Graphs.	WEA	2008	DBLP DOI BibTeX RDF	computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition
1	He Jiang, Xianchao Zhang, Guoliang Chen, MingChu Li	Backbone analysis and algorithm design for the quadratic assignment problem.	Science in China Series F: Information Sciences	2008	DBLP DOI BibTeX RDF	backbone analysis, biased instance, NP-hard, meta-heuristic, quadratic assignment problem
1	Camelia Chira, Camelia-Mihaela Pintea, Dumitru Dumitrescu	Sensitive Stigmergic Agent Systems - A Hybrid Approach to Combinatorial Optimization.	Innovations in Hybrid Intelligent Systems	2008	DBLP DOI BibTeX RDF	multi-agent system, ant colony optimization, sensitivity, agent communication, stigmergy
1	Christine L. Mumford	An Order Based Memetic Evolutionary Algorithm for Set Partitioning Problems.	Computational Intelligence: A Compendium	2008	DBLP DOI BibTeX RDF
1	Nysret Musliu	An Iterative Heuristic Algorithm for Tree Decomposition.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Heuristics, Constraint Satisfaction Problem, Tree Decomposition, Graph Decomposition, Iterated Local Search
1	Hadi Panahi, Masoud Rabbani, Reza Tavakkoli-Moghaddam	A Comparison of Three Meta-heuristics for a Closed-Loop Layout Problem with Unequal-Sized Facilities.	New Challenges in Applied Intelligence Technologies	2008	DBLP DOI BibTeX RDF	Closed-loop layout problem, unequal-sized facilities, Genetic algorithm, Simulated annealing, Ant colony optimization
1	Junzo Watada	DNA Computing and its Application.	Computational Intelligence: A Compendium	2008	DBLP DOI BibTeX RDF
1	Deniss Kumlander	NP-Hard Graph Problems' Algorithms Testing Guidelines: Artificial Intelligence Principles and Testing as a Service.	Innovative Techniques in Instruction Technology, E-learning, E-assessment, and Education	2008	DBLP DOI BibTeX RDF
1	Mohammad R. Gholamian, Seyyed M. T. Fatemi Ghomi, Mehdi Ghazanfari	A hybrid system for multiobjective problems - A case study in NP-hard problems.	Knowl.-Based Syst.	2007	DBLP DOI BibTeX RDF
1	Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh	Survivable network design with degree or order constraints.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithms, network design, NP-hard problems, bounded degree, iterative rounding
1	Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor	Algorithmic aspects of bandwidth trading.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching
1	Deying Li, Jiannong Cao, Ming Liu, Yuan Zheng	K -Connected Target Coverage Problem in Wireless Sensor Networks.	COCOA	2007	DBLP DOI BibTeX RDF	k-connected target coverage, k-connected augmentation, wireless sensor networks, heuristic algorithms, NP-hard problems
1	Franc Brglez, Jason A. Osborne	Performance testing of combinatorial solvers with isomorph class instances.	Experimental Computer Science	2007	DBLP DOI BibTeX RDF	scientific method
1	Jiong Guo, Rolf Niedermeier	Invitation to data reduction and problem kernelization.	SIGACT News	2007	DBLP DOI BibTeX RDF
1	Joshua W. Gilkerson, Jerzy W. Jaromczyk	The genetic algorithm scheme for consensus sequences.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	Brian Ivers, Gary G. Yen	Job shop optimization through multiple independent particle swarms.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	Ruhul A. Sarker, Tapabrata Ray, José Barahona da Fonseca	An evolutionary algorithm for machine layout and job assignment problems.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	Ladjel Bellatreche	Selection of Redundant and non Redundant Optimization Structures in VLDBs.	DEXA Workshops	2007	DBLP DOI BibTeX RDF
1	Jirí Kubalík, Richard Mordinyi	Optimizing Events Traffic in Event-based Systems by means of Evolutionary Algorithms.	ARES	2007	DBLP DOI BibTeX RDF
1	Stefan Andrei, Samarjit Chakraborty	Path-Constrained Relaxed Schedulability Analysis.	SYNASC	2007	DBLP DOI BibTeX RDF
1	Ole-Christoffer Granmo, B. John Oommen	On Using a Hierarchy of Twofold Resource Allocation Automata to Solve Stochastic Nonlinear Resource Allocation Problems.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
1	Frank Kammer	Determining the Smallest k Such That G Is k -Outerplanar.	ESA	2007	DBLP DOI BibTeX RDF	Outerplanarity index, k-outerplanar, SPQR trees, NP-hard, fixed-parameter algorithms
1	Nysret Musliu	Generation of Tree Decompositions by Iterated Local Search.	EvoCOP	2007	DBLP DOI BibTeX RDF
1	Rafal Drezewski, Lukasz Dronka, Jaroslaw Kozlak	Co-operative Co-evolutionary System for Solving Dynamic VRPTW Problems with Crisis Situations.	HoloMAS	2007	DBLP DOI BibTeX RDF
1	Giuliano Grossi, Federico Pedersini	FPGA Implementation of an Adaptive Stochastic Neural Model.	ICANN	2007	DBLP DOI BibTeX RDF
1	Zhifeng Hao, Han Huang, Yong Qin, Ruichu Cai	An ACO Algorithm with Adaptive Volatility Rate of Pheromone Trail.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	pheromone trail, adaptive volatility rate, Ant colony optimization
1	Vasek Chvátal	How To Be Fickle.	MFCS	2007	DBLP DOI BibTeX RDF
1	Jörg Steeg, Michael Schröder	A Hybrid Approach to Solve the Periodic Home Health Care Problem.	OR	2007	DBLP DOI BibTeX RDF
1	Amos Beimel, Renen Hallak, Kobbi Nissim	Private Approximation of Clustering and Vertex Cover.	TCC	2007	DBLP DOI BibTeX RDF
1	Pablo Rabanal, Ismael Rodríguez, Fernando Rubio	Using River Formation Dynamics to Design Heuristic Algorithms.	UC	2007	DBLP DOI BibTeX RDF	Nature-based Algorithms, Ant Colony Optimization Algorithms, Traveling Salesman Problem, Heuristic Algorithms
1	Yongxin Zhou 0002, Alec Main, Yuan Xiang Gu, Harold Johnson	Information Hiding in Software with Mixed Boolean-Arithmetic Transforms.	WISA	2007	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov	Power optimization for connectivity problems.	Math. Program.	2007	DBLP DOI BibTeX RDF
1	Franz Rendl, Renata Sotirov	Bounds for the quadratic assignment problem using the bundle method.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C27, 90C57, 90C51, 90C06
1	Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch	Exact Algorithms for Graph Homomorphisms.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Venkatesh Raman, Saket Saurabh, Somnath Sikdar	Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo	Confronting hardness using a hybrid approach.	SODA	2006	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Clique-width minimization is NP-hard.	STOC	2006	DBLP DOI BibTeX RDF	absolute approximation, NP-completeness, clique-width, pathwidth
1	Julia Chuzhoy, Joseph Naor	New hardness results for congestion minimization and machine scheduling.	J. ACM	2006	DBLP DOI BibTeX RDF	resource minimization, scheduling, network routing, Hardness of approximation, congestion minimization
1	David Eppstein	Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	Automated analysis of algorithms, Davis-Putnam procedures, method of feasible directions, multivariate recurrences, quasiconvex programming, backtracking, worst-case analysis