The graph segmentation problem

DOI10.1016/J.ENDM.2018.01.005MaRDI QIDQ1742196zbMATH OpenOpenAlexFDO

Authors Stephan Schwartz, Ralf Borndörfer, Gerald Bartz

Publication date 11 April 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.01.005

zbMATH Keywords

combinatorial optimizationgraph segmentationtoll billing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• On the complexity of graph tree partition problems.
• Research of multicriteria theoretical segmentation tasks on bipartite graphs
• scientific article; zbMATH DE number 1775433
• Segmentation problems
• On Two Segmentation Problems

Cites work

• Approximations of Weighted Independent Set and Hereditary Subset Problems
• Bilevel programming and price setting problems
• Reducibility among combinatorial problems

Cited in

(2)

• scientific article; zbMATH DE number 5904848 (Why is no real title available?)
• Research of multicriteria theoretical segmentation tasks on bipartite graphs

This page was built for publication: The graph segmentation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742196)