On the public citation graph

Finding a minimum-weightk-link path in graphs with the concave Monge property and applications

0 signed · 89 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/3-540-52921-7_81openalex-snapshot

Finding least-weight subsequences with fewer processors

inferredcites →https://doi.org/10.1007/3-540-54945-5_63openalex-snapshot

Dynamic programming on intervals

inferredcites →https://doi.org/10.1007/3-540-57568-5_278openalex-snapshot

Consecutive interval query and dynamic programming on intervals

inferredcites →https://doi.org/10.1007/bf01840359openalex-snapshot

Geometric applications of a matrix-searching algorithm

inferredcites →https://doi.org/10.1016/0196-6774(88)90032-6openalex-snapshot

The concave least-weight subsequence problem revisited

inferredcites →https://doi.org/10.1016/0196-6774(91)90016-ropenalex-snapshot

On-line dynamic programming with applications to the prediction of RNA secondary structure

inferredcites →https://doi.org/10.1016/0196-6774(91)90039-2openalex-snapshot

Optimal quantization by matrix searching

inferredcites →https://doi.org/10.1109/sfcs.1988.21966openalex-snapshot

Notes on searching in multidimensional monotone arrays

inferredcites →https://doi.org/10.1109/tc.1983.1676138openalex-snapshot

Searching, Merging, and Sorting in Parallel Computation

inferredcites →https://doi.org/10.1137/0214011openalex-snapshot

Finding Extremal Polygons

inferredcites →https://doi.org/10.1137/0403009openalex-snapshot

An Almost Linear Time Algorithm for Generalized Matrix Searching

inferredcites →https://doi.org/10.1145/113379.113386openalex-snapshot

Parallel construction of trees with optimal weighted path length

inferredcites →https://doi.org/10.1145/142675.142702openalex-snapshot

Diameter, width, closest line pair, and parametric searching

inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot

Slowing down sorting networks to obtain faster sorting algorithms

inferredcites →https://doi.org/10.5555/127787.127822openalex-snapshot

Optimal algorithms for tree partitioning

inferredcites →https://doi.org/10.5555/320176.320217openalex-snapshot

Length-limited coding

What points at this work

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

inferred← citeshttps://doi.org/10.1002/ecjc.20297openalex-snapshot

Recent progress on geometric algorithms for approximating functions: Toward applications to data analysis

inferred← citeshttps://doi.org/10.1006/jagm.1998.0955openalex-snapshot

Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property

inferred← citeshttps://doi.org/10.1007/11940128_70openalex-snapshot

Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy

inferred← citeshttps://doi.org/10.1007/3-540-45687-2_8openalex-snapshot

Fast Algorithms with Algebraic Monge Properties

inferred← citeshttps://doi.org/10.1007/3-540-48518-x_1openalex-snapshot

Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes

inferred← citeshttps://doi.org/10.1007/3-540-63307-3_79openalex-snapshot

Constructing pairwise disjoint paths with few links

inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_29openalex-snapshot

The Line-Constrained Maximum Coverage Facility Location Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_4openalex-snapshot

A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy

inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_1openalex-snapshot

Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane

inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_9openalex-snapshot

Polyline Fitting of Planar Points Under Min-sum Criteria

inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_37openalex-snapshot

Fitting a Step Function to a Point Set

inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_18openalex-snapshot

New Algorithms for 1-D Facility Location and Path Equipartition Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_64openalex-snapshot

Distribution-Aware Compressed Full-Text Indexes

inferred← citeshttps://doi.org/10.1007/s00453-001-0060-4openalex-snapshot

Bounding the Inefficiency of Length-Restricted Prefix Codes

inferred← citeshttps://doi.org/10.1007/s00453-009-9342-zopenalex-snapshot

Fitting a Step Function to a Point Set

inferred← citeshttps://doi.org/10.1007/s00453-009-9354-8openalex-snapshot

Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy

inferred← citeshttps://doi.org/10.1007/s00453-012-9737-0openalex-snapshot

New Algorithms for Facility Location Problems on the Real Line

inferred← citeshttps://doi.org/10.1007/s00453-013-9782-3openalex-snapshot

Distribution-Aware Compressed Full-Text Indexes

inferred← citeshttps://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot

Perspectives of Monge properties in optimization

inferred← citeshttps://doi.org/10.1016/j.cor.2015.11.012openalex-snapshot

Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem

inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.001openalex-snapshot

The algebraic Monge property and path problems

inferred← citeshttps://doi.org/10.1016/j.ejor.2005.06.080openalex-snapshot

The directional p-median problem: Definition, complexity, and algorithms

inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103681openalex-snapshot

The edit distance to k-subsequence universality

inferred← citeshttps://doi.org/10.1016/j.orl.2011.08.001openalex-snapshot

Improved algorithms for path partition and related problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.028openalex-snapshot

A circular matrix-merging algorithm with application in Volumetric Intensity-Modulated Arc Therapy

inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00139-1openalex-snapshot

Using total monotonicity for two optimization problems on the plane

inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00021-3openalex-snapshot

Consecutive interval query and dynamic programming on intervals

inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00099-3openalex-snapshot

Algorithms for optimal multi-resolution quantization

inferred← citeshttps://doi.org/10.1017/cbo9781139034357openalex-snapshot

Network-aware Source Coding and Communication

inferred← citeshttps://doi.org/10.1109/icassp.2018.8462220openalex-snapshot

Design of Optimal Entropy-Constrained Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources

inferred← citeshttps://doi.org/10.1109/icc.2004.1312548openalex-snapshot

Fast length-constrained MAP decoding of variable length coded Markov sequences over noisy channel

inferred← citeshttps://doi.org/10.1109/icip.1998.723548openalex-snapshot

A linear algorithm for optimal context clustering with application to bi-level image coding

inferred← citeshttps://doi.org/10.1109/icip.2014.7025822openalex-snapshot

Image enhancement by entropy maximization and quantization resolution upconversion

inferred← citeshttps://doi.org/10.1109/icme.2004.1394285openalex-snapshot

Length-constrained MAP decoding revisited

inferred← citeshttps://doi.org/10.1109/icme.2006.262481openalex-snapshot

Efficient Algorithm for Globally Optimal Uneven Erasure-Protected Packetization of Scalable Code Streams

inferred← citeshttps://doi.org/10.1109/smartcomp.2016.7501711openalex-snapshot

Optimal Skewed Allocation on Multiple Channels for Broadcast in Smart Cities

inferred← citeshttps://doi.org/10.1109/spire.1999.796585openalex-snapshot

Practical constructions of L-restricted alphabetic prefix codes

inferred← citeshttps://doi.org/10.1109/tcomm.2006.877945openalex-snapshot

Length-constrained MAP decoding of variable-length encoded Markov sequences

inferred← citeshttps://doi.org/10.1109/tcomm.2017.2789221openalex-snapshot

Design of Optimal Entropy-Constrained Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources

inferred← citeshttps://doi.org/10.1109/tip.2016.2598485openalex-snapshot

Image Enhancement by Entropy Maximization and Quantization Resolution Upconversion

inferred← citeshttps://doi.org/10.1109/tit.2006.881728openalex-snapshot

Source Coding for Quasiarithmetic Penalties

inferred← citeshttps://doi.org/10.1109/tit.2007.907498openalex-snapshot

Lagrangian Optimization of Two-Description Scalar Quantizers

inferred← citeshttps://doi.org/10.1109/tit.2010.2050947openalex-snapshot

A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property

inferred← citeshttps://doi.org/10.1109/tit.2015.2510658openalex-snapshot

On the Design of Optimal Noisy Channel Scalar Quantizer with Random Index Assignment

inferred← citeshttps://doi.org/10.1109/tmm.2007.906557openalex-snapshot

Efficient Algorithms for Optimal Uneven Protection of Single and Multiple Scalable Code Streams Against Packet Erasures

inferred← citeshttps://doi.org/10.1109/tsp.2007.896106openalex-snapshot

MAP Decoding of Variable Length Codes With Self-Synchronization Strings

inferred← citeshttps://doi.org/10.1109/vetecf.2005.1557965openalex-snapshot

MAP decoding of variable length codes with self-synchronization strings

inferred← citeshttps://doi.org/10.1137/1.9781611973068.83openalex-snapshot

A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding

inferred← citeshttps://doi.org/10.1137/1.9781611976465.88openalex-snapshot

(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems

inferred← citeshttps://doi.org/10.1137/17m1121457openalex-snapshot

Bicriteria Data Compression

inferred← citeshttps://doi.org/10.1137/s009753979731981xopenalex-snapshot

The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes

inferred← citeshttps://doi.org/10.1137/s0895480196309791openalex-snapshot

Finding Subsets Maximizing Minimum Structures

inferred← citeshttps://doi.org/10.1142/s0129626406002484openalex-snapshot

ALGORITHMS FOR CONSTRUCTION OF OPTIMAL AND ALMOST-OPTIMAL LENGTH-RESTRICTED CODES

inferred← citeshttps://doi.org/10.1142/s0218195901000420openalex-snapshot

EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION

inferred← citeshttps://doi.org/10.1142/s0218195903001104openalex-snapshot

TOPOLOGICAL PEELING AND APPLICATIONS

inferred← citeshttps://doi.org/10.1142/s0218195906001951openalex-snapshot

POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA

inferred← citeshttps://doi.org/10.1142/s0218195916600049openalex-snapshot

Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane

inferred← citeshttps://doi.org/10.1145/1273340.1273342openalex-snapshot

Constructing pairwise disjoint paths with few links

inferred← citeshttps://doi.org/10.1145/3077136.3080780openalex-snapshot

Faster BlockMax WAND with Variable-sized Blocks

inferred← citeshttps://doi.org/10.1162/evco_a_00157openalex-snapshot

Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms

inferred← citeshttps://doi.org/10.1201/9781315119335-15openalex-snapshot

Trees with Minimum Weighted Path Length

inferred← citeshttps://doi.org/10.1201/9781420035179-24openalex-snapshot

Trees with Minimum Weighted Path Length

inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16667openalex-snapshot

Proportional Representation under Single-Crossing Preferences Revisited

inferred← citeshttps://doi.org/10.1609/aaai.v37i9.26334openalex-snapshot

Optimal Sparse Regression Trees

inferred← citeshttps://doi.org/10.2139/ssrn.7439514openalex-snapshot

Hard and Tractable Cases of Solow--Polasky Diversity Subset Selection in Finite Metric Spaces

inferred← citeshttps://doi.org/10.24963/ijcai.2022/69openalex-snapshot

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

inferred← citeshttps://doi.org/10.4036/iis.2005.191openalex-snapshot

Peak-Reducing Fitting of a Curve under the Lp Metric

inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.8openalex-snapshot

Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings

inferred← citeshttps://doi.org/10.48550/arxiv.1701.07204openalex-snapshot

Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D

inferred← citeshttps://doi.org/10.48550/arxiv.1711.00181openalex-snapshot

Finding all Maximal Area Parallelograms in a Convex Polygon

inferred← citeshttps://doi.org/10.53846/goediss-10344openalex-snapshot

Matching Patterns with Variables in Approximate Settings

inferred← citeshttps://doi.org/10.5555/1496770.1496853openalex-snapshot

A generic top-down dynamic-programming approach to prefix-free coding

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.