On the public citation graph

A 3/2-approximation algorithm for the jump number of interval orders

https://doi.org/10.1007/bf00346129
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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00337920openalex-snapshot
On finding the jump number of a partial orber by substitution decomposition
inferredcites →https://doi.org/10.1007/bf00340778openalex-snapshot
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
inferredcites →https://doi.org/10.1007/bf00396269openalex-snapshot
Minimizing the jump number for partially ordered sets: A graph-theoretic approach
inferredcites →https://doi.org/10.1007/bf00714476openalex-snapshot
On minimizing the jump number for interval orders
inferredcites →https://doi.org/10.1016/0167-6377(85)90027-6openalex-snapshot
A setup heuristic for interval orders
inferredcites →https://doi.org/10.1090/s0002-9939-1982-0660592-3openalex-snapshot
Minimizing Setups for Cycle-Free Ordered Sets
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0715851-3openalex-snapshot
Optimal Linear Extensions by Interchanging Chains
inferredcites →https://doi.org/10.1137/0214068openalex-snapshot
Algorithmic Approaches to Setup Minimization

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-3-319-03898-8_20openalex-snapshot
The Jump Number Problem: Exact and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-642-79459-9_27openalex-snapshot
Exact and Heuristic Algorithms for the Jump Number Problem
inferred← citeshttps://doi.org/10.1007/bf00383200openalex-snapshot
On minimizing jumps for ordered sets
inferred← citeshttps://doi.org/10.1007/bf00383398openalex-snapshot
Tackling the jump number of interval orders
inferred← citeshttps://doi.org/10.1007/s11083-012-9246-4openalex-snapshot
The Arboreal Jump Number of an Order
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00290-yopenalex-snapshot
The jump number problem on interval orders: A 32 approximation algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90255-topenalex-snapshot
On a setup optimization problem for interval orders
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.035openalex-snapshot
Improved approximation algorithm for the jump number of interval orders
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.002openalex-snapshot
A refined analysis on the jump number problem of interval orders
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.011openalex-snapshot
An improved approximation ratio for the jump number problem on interval orders
inferred← citeshttps://doi.org/10.1023/a:1006069500025openalex-snapshot
Genetic Algorithm for the Jump Number Scheduling Problem
inferred← citeshttps://doi.org/10.1023/a:1008625405476openalex-snapshot
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets
inferred← citeshttps://doi.org/10.1023/a:1024417802690openalex-snapshot
A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete
inferred← citeshttps://doi.org/10.2478/v10065-011-0025-4openalex-snapshot
The database of interval orders difficult for the jump number minimizing algorithms
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.