On the public citation graph
A Survey of Approximation Results for Local Search Algorithms
0 signed · 129 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1006/jagm.2000.1100openalex-snapshot
Analysis of a Local Search Heuristic for Facility Location Problems
inferredcites →https://doi.org/10.1006/jagm.2000.1155openalex-snapshot
Greedy Local Improvement and Weighted Set Packing Approximation
inferredcites →https://doi.org/10.1007/3-540-44867-5openalex-snapshot
Experimental and Efficient Algorithms
inferredcites →https://doi.org/10.1007/3-540-44867-5_9openalex-snapshot
Linear Time Local Improvements for Weighted Matchings in Graphs
inferredcites →https://doi.org/10.1007/3-540-44985-x_19openalex-snapshot
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
inferredcites →https://doi.org/10.1007/3-540-45414-4_4openalex-snapshot
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
inferredcites →https://doi.org/10.1007/3-540-45535-3_29openalex-snapshot
Performance Guarantees of Local Search for Multiprocessor Scheduling
inferredcites →https://doi.org/10.1007/3-540-48432-9_15openalex-snapshot
A New Algorithm for Energy Minimization with Discontinuities
inferredcites →https://doi.org/10.1007/3-540-52282-4_52openalex-snapshot
The analysis of local search problems and their heuristics
inferredcites →https://doi.org/10.1007/3-540-57811-0_5openalex-snapshot
New local search approximation techniques for maximum generalized satisfiability problems
inferredcites →https://doi.org/10.1007/3-540-57880-3_2openalex-snapshot
Pi-nets: A graphical form of π-calculus
inferredcites →https://doi.org/10.1007/3-540-58218-5_18openalex-snapshot
Improved approximations of independent sets in bounded-degree graphs
inferredcites →https://doi.org/10.1007/3-540-60618-1_74openalex-snapshot
Non-oblivious local search for graph and hypergraph coloring problems
inferredcites →https://doi.org/10.1007/3-540-61680-2_47openalex-snapshot
Positive linear programming, parallel approximation and PCP's
inferredcites →https://doi.org/10.1007/3-540-63397-9openalex-snapshot
Algorithms - ESA '97: 5th Annual European Symposium, Graz, Austria, September 15-17, 1997. Proceedings
inferredcites →https://doi.org/10.1007/3-540-63397-9_2openalex-snapshot
On local search for weighted κ-set packing
inferredcites →https://doi.org/10.1007/978-1-4613-0303-9_2openalex-snapshot
Approximate Algorithms and Heuristics for MAX-SAT
inferredcites →https://doi.org/10.1007/978-1-4615-1507-4openalex-snapshot
Essays and Surveys in Metaheuristics
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4openalex-snapshot
Handbook of Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4899-7687-1_100317openalex-snapshot
Multi-criteria Optimization
inferredcites →https://doi.org/10.1007/978-3-662-04616-6openalex-snapshot
Algorithmics for Hard Problems
inferredcites →https://doi.org/10.1007/978-3-662-21708-5_16openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1007/bf02523688openalex-snapshot
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
inferredcites →https://doi.org/10.1007/bfb0024483openalex-snapshot
Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT
inferredcites →https://doi.org/10.1007/s004540010019openalex-snapshot
On Approximate Geometric k -Clustering
inferredcites →https://doi.org/10.1007/s10479-005-3971-7openalex-snapshot
Metaheuristics in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0020-0190(92)90208-dopenalex-snapshot
Approximation algorithms for geometric median problems
inferredcites →https://doi.org/10.1016/0020-0190(95)00006-xopenalex-snapshot
Local search, reducibility and approximability of NP-optimization problems
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0166-218x(83)90080-xopenalex-snapshot
Efficient bounds for the stable set, vertex cover and set packing problems
inferredcites →https://doi.org/10.1016/0166-218x(92)90113-oopenalex-snapshot
Paroids: a canonical format for combinatorial optimization
inferredcites →https://doi.org/10.1016/0166-218x(93)90005-9openalex-snapshot
Paroid search: generic local combinatorial optimization
inferredcites →https://doi.org/10.1016/0166-218x(95)00030-uopenalex-snapshot
Improving local search heuristics for some scheduling problems—I
inferredcites →https://doi.org/10.1016/0167-6377(92)90049-9openalex-snapshot
Local search and the local structure of NP-complete problems
inferredcites →https://doi.org/10.1016/0377-2217(91)90197-4openalex-snapshot
QAPLIB-A quadratic assignment problem library
inferredcites →https://doi.org/10.1016/j.orl.2003.08.004openalex-snapshot
Local approximations for maximum partial subgraph problem
inferredcites →https://doi.org/10.1016/s0012-365x(98)00115-0openalex-snapshot
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdos inequality
inferredcites →https://doi.org/10.1016/s0020-0190(02)00230-2openalex-snapshot
A note on the minimum label spanning tree
inferredcites →https://doi.org/10.1016/s0020-0190(97)00127-0openalex-snapshot
The minimum labeling spanning trees
inferredcites →https://doi.org/10.1016/s0020-0190(98)00034-9openalex-snapshot
On the minimum label spanning tree problem
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/s0166-218x(01)00338-9openalex-snapshot
A survey of very large-scale neighborhood search techniques
inferredcites →https://doi.org/10.1016/s0166-218x(02)00404-3openalex-snapshot
Worst-case study of local search for MAX-k-SAT
inferredcites →https://doi.org/10.1016/s0166-218x(96)00036-4openalex-snapshot
Improving local search heuristics for some scheduling problems. Part II
inferredcites →https://doi.org/10.1016/s0166-218x(96)00063-7openalex-snapshot
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
inferredcites →https://doi.org/10.1016/s0166-218x(97)00129-7openalex-snapshot
On the quality of local search for the quadratic assignment problem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1016/s0167-6377(02)00165-7openalex-snapshot
On local search for the generalized graph coloring problem
inferredcites →https://doi.org/10.1016/s0167-6377(02)00241-9openalex-snapshot
Local search for the minimum label spanning tree problem with bounded color classes
inferredcites →https://doi.org/10.1016/s0196-6774(02)00005-6openalex-snapshot
Improved approximation of Max-Cut on graphs of bounded degree
inferredcites →https://doi.org/10.1016/s0196-6774(03)00056-7openalex-snapshot
A constant factor approximation algorithm for the fault-tolerant facility location problem
inferredcites →https://doi.org/10.1016/s0304-3975(01)00174-8openalex-snapshot
A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search
inferredcites →https://doi.org/10.1016/s0304-3975(03)00376-1openalex-snapshot
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
inferredcites →https://doi.org/10.1016/s0304-3975(96)00135-1openalex-snapshot
Finding optimal subgraphs by local search
inferredcites →https://doi.org/10.1016/s0377-2217(02)00825-1openalex-snapshot
Lexicographic local search and the p-center problem
inferredcites →https://doi.org/10.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
inferredcites →https://doi.org/10.1017/cbo9780511616655openalex-snapshot
A First Course in Combinatorial Optimization
inferredcites →https://doi.org/10.1023/a:1008293323270openalex-snapshot
QAPLIB – A Quadratic Assignment Problem Library
inferredcites →https://doi.org/10.1090/dimacs/016/01openalex-snapshot
The quadratic assignment problem: A survey and recent developments
inferredcites →https://doi.org/10.1090/dimacs/035/19openalex-snapshot
Solving MAX-SAT with nonoblivious functions and history-based heuristics
inferredcites →https://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferredcites →https://doi.org/10.1109/sfcs.1989.63481openalex-snapshot
Structure in locally optimal solutions
inferredcites →https://doi.org/10.1109/sfcs.1991.185365openalex-snapshot
On selecting a satisfying truth assignment
inferredcites →https://doi.org/10.1109/sfcs.1994.365712openalex-snapshot
On syntactic versus computational views of approximability
inferredcites →https://doi.org/10.1109/sffcs.1999.814571openalex-snapshot
Primal-dual approximation algorithms for metric facility location and k-median problems
inferredcites →https://doi.org/10.1109/sffcs.1999.814609openalex-snapshot
Improved combinatorial algorithms for the facility location and k-median problems
inferredcites →https://doi.org/10.1137/0206013openalex-snapshot
Bounds for LPT Schedules on Uniform Processors
inferredcites →https://doi.org/10.1137/0209007openalex-snapshot
Bounds for List Schedules on Uniform Processors
inferredcites →https://doi.org/10.1137/0217033openalex-snapshot
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
inferredcites →https://doi.org/10.1137/0220004openalex-snapshot
Simple Local Search Problems that are Hard to Solve
inferredcites →https://doi.org/10.1137/0221030openalex-snapshot
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1137/0402008openalex-snapshot
On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
inferredcites →https://doi.org/10.1137/s0097539702416402openalex-snapshot
Local Search Heuristics for k -Median and Facility Location Problems
inferredcites →https://doi.org/10.1137/s0097539703431007openalex-snapshot
Approximate Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.1137/s0097539793245350openalex-snapshot
Integer Linear Programs and Local Search for Max-Cut
inferredcites →https://doi.org/10.1137/s0097539793251244openalex-snapshot
New Results on the Old k -opt Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1137/s0097539795286612openalex-snapshot
On Syntactic versus Computational Views of Approximability
inferredcites →https://doi.org/10.1137/s0097539799363359openalex-snapshot
On Local Search and Placement of Meters in Networks
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/258533.258599openalex-snapshot
Approximation of k -set cover by semi-local optimization
inferredcites →https://doi.org/10.1145/258533.258600openalex-snapshot
Approximation algorithms for facility location problems (extended abstract)
inferredcites →https://doi.org/10.1145/380752.380755openalex-snapshot
Local search heuristic for k-median and facility location problems
inferredcites →https://doi.org/10.1145/513400.513402openalex-snapshot
A local search approximation algorithm for k-means clustering
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1145/937503.937505openalex-snapshot
Metaheuristics in combinatorial optimization
inferredcites →https://doi.org/10.1287/moor.18.1.1openalex-snapshot
The Traveling Salesman Problem with Distances One and Two
inferredcites →https://doi.org/10.1287/moor.23.3.640openalex-snapshot
On Local Search for Weighted k-Set Packing
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1515/9780691187563openalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.2307/1907742openalex-snapshot
Assignment Problems and the Location of Economic Activities
inferredcites →https://doi.org/10.2307/j.ctv346t9copenalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.4153/cjm-1973-048-xopenalex-snapshot
Some Extremal Properties of Bipartite Subgraphs
inferredcites →https://doi.org/10.5555/313651.313687openalex-snapshot
Approximating discrete collections via local improvements
inferredcites →https://doi.org/10.5555/314464.314489openalex-snapshot
New results on the old k-opt algorithm for the TSP
inferredcites →https://doi.org/10.5555/314464.314570openalex-snapshot
Approximating maximum independent set in bounded degree graphs
inferredcites →https://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
inferredcites →https://doi.org/10.7155/jgaa.00003openalex-snapshot
Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.20485openalex-snapshot
Exponential size neighborhoods for makespan minimization scheduling
inferred← citeshttps://doi.org/10.1002/net.21512openalex-snapshot
Nonoblivious 2‐Opt heuristics for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_15openalex-snapshot
On the Complexity of Local Search for Weighted Standard Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_65openalex-snapshot
Smoothed Performance Guarantees for Local Search
inferred← citeshttps://doi.org/10.1007/s10107-013-0683-7openalex-snapshot
Smoothed performance guarantees for local search
inferred← citeshttps://doi.org/10.1007/s10107-020-01571-5openalex-snapshot
Performance guarantees of local search for minsum scheduling problems
inferred← citeshttps://doi.org/10.1007/s10878-012-9580-xopenalex-snapshot
Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
inferred← citeshttps://doi.org/10.1007/s40314-025-03457-8openalex-snapshot
Application of possibilistic optimization to interval-valued fuzzy numbers: supplemental diet
inferred← citeshttps://doi.org/10.1016/j.adhoc.2016.05.007openalex-snapshot
Hypergraph matching for MU-MIMO user grouping in wireless LANs
inferred← citeshttps://doi.org/10.1016/j.robot.2021.103840openalex-snapshot
Evolutionary Tabu Inverted Ant Cellular Automata with Elitist Inertia for swarm robotics as surrogate method in surveillance task using e-Puck architecture
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.004openalex-snapshot
Uniform unweighted set cover: The power of non-oblivious local search
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.044openalex-snapshot
On the PLS -complexity of maximum constraint assignment
inferred← citeshttps://doi.org/10.1051/ro/2022045openalex-snapshot
Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
inferred← citeshttps://doi.org/10.1080/00207160.2015.1071359openalex-snapshot
Approximation performance of ant colony optimization for the TSP(1,2) problem
inferred← citeshttps://doi.org/10.1109/jsac.2013.131106openalex-snapshot
Low Delay MAC Scheduling for Frequency-Agile Multi-Radio Wireless Networks
inferred← citeshttps://doi.org/10.1145/3452021.3458813openalex-snapshot
Approximation Algorithms for Large Scale Data Analysis
inferred← citeshttps://doi.org/10.32657/10356/48091openalex-snapshot
A generic bee colony optimization framework for combinatorial optimization problems
inferred← citeshttps://doi.org/10.32657/10356/59538openalex-snapshot
Online test paper generation for a web-based mathematics testing environment
inferred← citeshttps://doi.org/10.3390/math12010006openalex-snapshot
Developing New Bounds for the Performance Guarantee of the Jump Neighborhood for Scheduling Jobs on Uniformly Related Machines
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.