On the public citation graph
An Improved Approximation Algorithm for MULTIWAY CUT
0 signed · 138 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/net.3230210106openalex-snapshot
On the multiway cut polyhedron
inferredcites →https://doi.org/10.1007/978-3-642-78240-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01581691openalex-snapshot
On weighted multiway cuts in trees
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1090/dimacs/005/07openalex-snapshot
The optimal multiterminal cut problem
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1112/blms/21.5.499openalex-snapshot
INTEGER AND COMBINATORIAL OPTIMIZATION
inferredcites →https://doi.org/10.1137/0606068openalex-snapshot
An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
inferredcites →https://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
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.20341openalex-snapshot
Algorithms for the minimum partitioning problems in graphs
inferred← citeshttps://doi.org/10.1002/net.20203openalex-snapshot
Approximability of the k ‐server disconnection problem
inferred← citeshttps://doi.org/10.1002/net.20478openalex-snapshot
On the minimum cut separator problem
inferred← citeshttps://doi.org/10.1002/net.21534openalex-snapshot
Complexity and approximability of the k‐way vertex cut
inferred← citeshttps://doi.org/10.1002/spe.2165openalex-snapshot
Curracurrong: a stream programming environment for wireless sensor networks
inferred← citeshttps://doi.org/10.1007/11427186_17openalex-snapshot
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
inferred← citeshttps://doi.org/10.1007/11671541_8openalex-snapshot
Approximating a Class of Classification Problems
inferred← citeshttps://doi.org/10.1007/11682462_41openalex-snapshot
Cut Problems in Graphs with a Budget Constraint
inferred← citeshttps://doi.org/10.1007/11830924_18openalex-snapshot
Approximation Algorithms for Graph Homomorphism Problems
inferred← citeshttps://doi.org/10.1007/11970125_26openalex-snapshot
Online Distributed Object Migration
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_17openalex-snapshot
Approximating Steiner k-Cuts
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_29openalex-snapshot
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_9openalex-snapshot
Improving the Integrality Gap for Multiway Cut
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_6openalex-snapshot
Monotone Submodular Multiway Partition
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_40openalex-snapshot
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_13openalex-snapshot
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_4openalex-snapshot
Approximation and Hardness Results for the Max k-Uncut Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-59250-3_4openalex-snapshot
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_24openalex-snapshot
The Multi-multiway Cut Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_39openalex-snapshot
Algorithms for 2-Route Cut Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_43openalex-snapshot
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_39openalex-snapshot
Approximation Algorithms for k-Hurdle Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_32openalex-snapshot
Algorithms for Multiterminal Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-17572-5_21openalex-snapshot
Strategic Cooperation in Cost Sharing Games
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_1openalex-snapshot
Strategic Multiway Cut and Multicut Games
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_20openalex-snapshot
How to Cut a Graph into Many Pieces
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_30openalex-snapshot
Submodular Cost Allocation Problem and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-23094-3_3openalex-snapshot
Globally Optimal Image Partitioning by Multicuts
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_32openalex-snapshot
From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?
inferred← citeshttps://doi.org/10.1007/s00182-011-0312-8openalex-snapshot
Strategic cooperation in cost sharing games
inferred← citeshttps://doi.org/10.1007/s00224-009-9215-5openalex-snapshot
Simple and Improved Parameterized Algorithms for Multiterminal Cuts
inferred← citeshttps://doi.org/10.1007/s00224-011-9380-1openalex-snapshot
Strategic Multiway Cut and Multicut Games
inferred← citeshttps://doi.org/10.1007/s00453-003-1061-2openalex-snapshot
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-007-9130-6openalex-snapshot
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
inferred← citeshttps://doi.org/10.1007/s00453-008-9171-5openalex-snapshot
Approximation Algorithms for Requirement Cut on Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9408-yopenalex-snapshot
Approximation Algorithms for k-hurdle Problems
inferred← citeshttps://doi.org/10.1007/s00453-013-9761-8openalex-snapshot
On the Advantage of Overlapping Clusters for Minimizing Conductance
inferred← citeshttps://doi.org/10.1007/s00453-017-0302-8openalex-snapshot
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
inferred← citeshttps://doi.org/10.1007/s00453-022-00983-3openalex-snapshot
$$\ell _p$$-Norm Multiway Cut
inferred← citeshttps://doi.org/10.1007/s00454-020-00232-wopenalex-snapshot
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
inferred← citeshttps://doi.org/10.1007/s10107-004-0510-2openalex-snapshot
Greedy splitting algorithms for approximating multiway partition problems
inferred← citeshttps://doi.org/10.1007/s10107-005-0668-2openalex-snapshot
Optimal 3-terminal cuts and linear programming
inferred← citeshttps://doi.org/10.1007/s10107-018-1270-8openalex-snapshot
Beating the 2-approximation factor for global bicut
inferred← citeshttps://doi.org/10.1007/s10107-022-01824-5openalex-snapshot
Vertex downgrading to minimize connectivity
inferred← citeshttps://doi.org/10.1007/s10878-010-9320-zopenalex-snapshot
Geometric rounding: a dependent randomized rounding scheme
inferred← citeshttps://doi.org/10.1007/s11081-021-09648-6openalex-snapshot
On the (near) optimality of extended formulations for multi-way cut in social networks
inferred← citeshttps://doi.org/10.1007/s11263-013-0621-4openalex-snapshot
Discrete and Continuous Models for Partitioning Problems
inferred← citeshttps://doi.org/10.1007/s11263-015-0809-xopenalex-snapshot
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
inferred← citeshttps://doi.org/10.1016/j.cviu.2015.11.005openalex-snapshot
Higher-order segmentation via multicuts
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.003openalex-snapshot
On a bidirected relaxation for the MULTIWAY CUT problem
inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.016openalex-snapshot
An approximation algorithm for the Generalized k -Multicut problem
inferred← citeshttps://doi.org/10.1016/j.dam.2025.10.051openalex-snapshot
Multiway cuts with a choice of representatives
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.07.001openalex-snapshot
Generating partitions of a graph into a fixed number of minimum weight cuts
inferred← citeshttps://doi.org/10.1016/j.future.2007.07.013openalex-snapshot
A resource aware software partitioning algorithm based on mobility constraints in pervasive grid environments
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.10.012openalex-snapshot
Clustering with qualitative information
inferred← citeshttps://doi.org/10.1016/j.jda.2006.05.002openalex-snapshot
Cut problems in graphs with a budget constraint
inferred← citeshttps://doi.org/10.1016/j.orl.2019.09.012openalex-snapshot
A simple algorithm for the multiway cut problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.026openalex-snapshot
The multi-multiway cut problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.003openalex-snapshot
Algorithmic aspects of homophyly of networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.003openalex-snapshot
Approximation and hardness results for the Max k-Uncut problem
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00111-1openalex-snapshot
Multiway cuts in node weighted graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1109/cso.2009.361openalex-snapshot
A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees
inferred← citeshttps://doi.org/10.1109/cvprw.2006.187openalex-snapshot
Segmentation of Neighboring Structures by Modeling Their Interaction
inferred← citeshttps://doi.org/10.1109/focs.2011.34openalex-snapshot
Approximation Algorithms for Submodular Multiway Partition
inferred← citeshttps://doi.org/10.1109/focs.2011.79openalex-snapshot
Min-max Graph Partitioning and Small Set Expansion
inferred← citeshttps://doi.org/10.1109/grid.2011.14openalex-snapshot
Graph-Cut Based Coscheduling Strategy Towards Efficient Execution of Scientific Workflows in Collaborative Cloud Environments
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228230openalex-snapshot
Multi-multiway cuts with edge labels
inferred← citeshttps://doi.org/10.1109/icie.2009.217openalex-snapshot
Colored Multiway Cuts in Generalized Tree Networks
inferred← citeshttps://doi.org/10.1109/icnp.2017.8117535openalex-snapshot
BoLTE: Efficient network-wide LTE broadcasting
inferred← citeshttps://doi.org/10.1109/ifita.2009.491openalex-snapshot
Colored Multiway Cuts in Trees of Rings
inferred← citeshttps://doi.org/10.1109/ifita.2010.171openalex-snapshot
Bounded Size Graph Clustering on Trees
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155344openalex-snapshot
Stealthy DGoS Attack: DeGrading of Service under the Watch of Network Tomography
inferred← citeshttps://doi.org/10.1109/itng.2006.112openalex-snapshot
Reliable Deployment of Component-based Applications into Distributed Environments
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238225openalex-snapshot
Clustering with qualitative information
inferred← citeshttps://doi.org/10.1109/tcc.2015.2511745openalex-snapshot
A Data and Task Co-Scheduling Algorithm for Scientific Cloud Workflows
inferred← citeshttps://doi.org/10.1109/tnet.2021.3058230openalex-snapshot
Stealthy DGoS Attack: DeGrading of Service Under the Watch of Network Tomography
inferred← citeshttps://doi.org/10.1109/tpami.2016.2582165openalex-snapshot
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
inferred← citeshttps://doi.org/10.1109/tpami.2020.3023152openalex-snapshot
Leveraging Instance-, Image- and Dataset-Level Information for Weakly Supervised Instance Segmentation
inferred← citeshttps://doi.org/10.1134/s1064230706040083openalex-snapshot
Models and methods for solving the problem of network vulnerability
inferred← citeshttps://doi.org/10.1137/1.9781611973068.114openalex-snapshot
Packing multiway cuts in capacitated graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch57openalex-snapshot
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
inferred← citeshttps://doi.org/10.1137/110856733openalex-snapshot
A Convex Approach to Minimal Partitions
inferred← citeshttps://doi.org/10.1137/120873996openalex-snapshot
Min-Max Graph Partitioning and Small Set Expansion
inferred← citeshttps://doi.org/10.1137/15m1045521openalex-snapshot
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem
inferred← citeshttps://doi.org/10.1137/20m1321048openalex-snapshot
Hypergraph Cuts with General Splitting Functions
inferred← citeshttps://doi.org/10.1137/s0097539701395978openalex-snapshot
Approximation Algorithms for the 0-Extension Problem
inferred← citeshttps://doi.org/10.1137/s009753979732147xopenalex-snapshot
A 2-Approximation Algorithm for the Directed Multiway Cut Problem
inferred← citeshttps://doi.org/10.1137/s0895480101396937openalex-snapshot
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
inferred← citeshttps://doi.org/10.1145/1132516.1132595openalex-snapshot
On earthmover distance, metric labeling, and 0-extension
inferred← citeshttps://doi.org/10.1145/1143844.1143894openalex-snapshot
An analysis of graph cut size for transductive learning
inferred← citeshttps://doi.org/10.1145/1557019.1557077openalex-snapshot
Meme-tracking and the dynamics of the news cycle
inferred← citeshttps://doi.org/10.1145/2229012.2229016openalex-snapshot
Combinatorial auctions with restricted complements
inferred← citeshttps://doi.org/10.1145/2488608.2488675openalex-snapshot
Simplex partitioning via exponential clocks and the multiway cut problem
inferred← citeshttps://doi.org/10.1145/2591796.2591866openalex-snapshot
Multiway cut, pairwise realizable distributions, and descending thresholds
inferred← citeshttps://doi.org/10.1145/3366423.3380152openalex-snapshot
Clustering in graphs and hypergraphs with categorical edge labels
inferred← citeshttps://doi.org/10.1145/3406325.3451071openalex-snapshot
The metric relaxation for 0 -extension admits an Ω(log 2/3 k) gap
inferred← citeshttps://doi.org/10.1145/3776738openalex-snapshot
Planar Multiway Cut with Terminals on Few Faces
inferred← citeshttps://doi.org/10.1145/3798129.3800853openalex-snapshot
Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
inferred← citeshttps://doi.org/10.11606/d.45.2016.tde-27012016-090223openalex-snapshot
Problemas computacionais em teoria topológica dos grafos
inferred← citeshttps://doi.org/10.1287/moor.1030.0086openalex-snapshot
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
inferred← citeshttps://doi.org/10.1287/moor.2020.1073openalex-snapshot
Simplex Transformations and the Multiway Cut Problem
inferred← citeshttps://doi.org/10.13140/rg.2.2.22777.93289openalex-snapshot
Entropy-based framework for combinatorial optimization problems; and Enabling the grid of the future
inferred← citeshttps://doi.org/10.22456/2175-2745.49694openalex-snapshot
Programação matemática e imersões métricas para aproximações em problemas de corte
inferred← citeshttps://doi.org/10.26481/dis.20121102gzopenalex-snapshot
Broadcast and network optimization : essays on approximation algorithms and experiments on problems in latency cover, network fragmentation and routing on the internet
inferred← citeshttps://doi.org/10.3390/a16070341openalex-snapshot
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2020.60openalex-snapshot
Efficient Enumerations for Minimal Multicuts and Multiway Cuts
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3131openalex-snapshot
Strategic Cooperation in Cost Sharing Games
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6267openalex-snapshot
Computing multiway cut within the given excess over the largest minimum isolating cut
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4319openalex-snapshot
Min-Max Graph Partitioning and Small Set Expansion
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6387openalex-snapshot
Higher-order Segmentation via Multicuts
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11229openalex-snapshot
Downgrading to Minimize Connectivity
inferred← citeshttps://doi.org/10.5555/1496770.1496884openalex-snapshot
Packing multiway cuts in capacitated graphs
inferred← citeshttps://doi.org/10.5555/2627817.2627840openalex-snapshot
Local distribution and the symmetry gap: approximability of multiway partitioning problems
inferred← citeshttps://doi.org/10.5555/982792.982952openalex-snapshot
Approximate classification via earthmover metrics
inferred← citeshttps://doi.org/10.64898/2026.06.01.729192openalex-snapshot
Reachability-Preserving Minimum Edge Cut Problem and Applications in Biology
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.