On the public citation graph

Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications

https://doi.org/10.1007/11671541
0 signed · 22 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_4openalex-snapshot
Classic Scheduling Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-41706-6_1openalex-snapshot
Online Social Networks Event Detection: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_12openalex-snapshot
An Approximation Algorithm for the General Mixed Packing and Covering Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_25openalex-snapshot
Scheduling Jobs on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1007/s00453-009-9278-3openalex-snapshot
Fractional Path Coloring in Bounded Degree Trees with Applications
inferred← citeshttps://doi.org/10.1007/s00453-012-9701-zopenalex-snapshot
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation
inferred← citeshttps://doi.org/10.1007/s11590-009-0146-5openalex-snapshot
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
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.disopt.2022.100753openalex-snapshot
An improved greedy algorithm for stochastic online scheduling on unrelated machines
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.02.059openalex-snapshot
Resource cost aware scheduling
inferred← citeshttps://doi.org/10.1016/j.ins.2017.08.033openalex-snapshot
Scalable Gaussian Kernel Support Vector Machines with Sublinear Training Time Complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.018openalex-snapshot
Approximating total flow time on parallel machines
inferred← citeshttps://doi.org/10.1016/j.protcy.2013.12.422openalex-snapshot
Approximate Data Mining Using Sketches for Massive Data
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.2007.02.064openalex-snapshot
Faster and simpler approximation algorithms for mixed packing and covering problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.025openalex-snapshot
A tight bound for online colouring of disk graphs
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.1080/10556788.2010.544308openalex-snapshot
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
inferred← citeshttps://doi.org/10.1109/cit.2008.workshops.118openalex-snapshot
CUZ: An Improved Clustering Algorithm
inferred← citeshttps://doi.org/10.1145/3349265openalex-snapshot
A Comprehensive Survey on Cloud Data Mining (CDM) Frameworks and Algorithms
inferred← citeshttps://doi.org/10.1371/journal.pone.0145222openalex-snapshot
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
inferred← citeshttps://doi.org/10.17760/d20474697openalex-snapshot
Leveraging geometric approaches in data analytics and optimization
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.