On the public citation graph

Increasing the rooted-connectivity of a digraph by one

0 signed · 42 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/bf01580218openalex-snapshot
Packing rooted directed cuts in a weighted directed graph
inferredcites →https://doi.org/10.1007/bf02592089openalex-snapshot
Submodular linear programs on forests
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11830924_23openalex-snapshot
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_23openalex-snapshot
Decomposing Probability Marginals Beyond Affine Requirements
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_11openalex-snapshot
A New Approach for Approximating Directed Rooted Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-79309-0_21openalex-snapshot
A Hierarchical Model for Cooperative Games
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_9openalex-snapshot
On Generalizations of Network Design Problems with Degree Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_30openalex-snapshot
Lattices and Maximum Flow Algorithms in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_13openalex-snapshot
On Greedy and Submodular Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_26openalex-snapshot
A Primal-Dual Algorithm for Weighted Abstract Cut Packing
inferred← citeshttps://doi.org/10.1007/s00453-011-9538-xopenalex-snapshot
Approximating Node-Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/s00453-017-0306-4openalex-snapshot
Greedy Oriented Flows
inferred← citeshttps://doi.org/10.1007/s10107-010-0406-2openalex-snapshot
A ranking model for the greedy algorithm and discrete convexity
inferred← citeshttps://doi.org/10.1007/s10107-012-0537-8openalex-snapshot
On generalizations of network design problems with degree bounds
inferred← citeshttps://doi.org/10.1007/s10107-014-0746-4openalex-snapshot
Packing in generalized kernel systems: a framework that generalizes packing of branchings
inferred← citeshttps://doi.org/10.1007/s10107-015-0948-4openalex-snapshot
Stronger bounds and faster algorithms for packing in generalized kernel systems
inferred← citeshttps://doi.org/10.1007/s10107-018-1242-zopenalex-snapshot
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
inferred← citeshttps://doi.org/10.1007/s13160-012-0084-yopenalex-snapshot
Lattice polyhedra and submodular flows
inferred← citeshttps://doi.org/10.1007/s13160-012-0085-xopenalex-snapshot
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.040openalex-snapshot
Rooted k -connections in digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.12.001openalex-snapshot
Approximating minimum-power edge-covers and 2,3 -connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.027openalex-snapshot
A simple algorithm and min–max formula for the inverse arborescence problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.03.004openalex-snapshot
Dual greedy polyhedra, choice functions, and abstract convex geometries
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.03.001openalex-snapshot
Note on pseudolattices, lattices and submodular linear programs
inferred← citeshttps://doi.org/10.1016/j.sorms.2010.06.001openalex-snapshot
Approximation algorithms for network design: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.009openalex-snapshot
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00467-5openalex-snapshot
A greedy algorithm for convex geometries
inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1023/a:1006406424957openalex-snapshot
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games
inferred← citeshttps://doi.org/10.1023/a:1012746124612openalex-snapshot
Submodular Functions in Problems of Synthesis of Networks
inferred← citeshttps://doi.org/10.1137/080734340openalex-snapshot
Additive Guarantees for Degree-Bounded Directed Network Design
inferred← citeshttps://doi.org/10.1137/100818728openalex-snapshot
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs
inferred← citeshttps://doi.org/10.1137/110855910openalex-snapshot
An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
inferred← citeshttps://doi.org/10.1137/s0097539703435753openalex-snapshot
Approximating k -node Connected Subgraphs via Critical Graphs
inferred← citeshttps://doi.org/10.1145/1374376.1374486openalex-snapshot
Additive guarantees for degree bounded directed network design
inferred← citeshttps://doi.org/10.1145/1824777.1824785openalex-snapshot
Two-phase greedy algorithms for some classes of combinatorial linear programs
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
inferred← citeshttps://doi.org/10.11606/t.45.2012.tde-15022013-111836openalex-snapshot
Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.63openalex-snapshot
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1704.08522openalex-snapshot
The Primal-Dual Greedy Algorithm for Weighted Covering Problems
inferred← citeshttps://doi.org/10.5555/1496770.1496869openalex-snapshot
An almost O(log k)-approximation for k-connected subgraphs
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.