Search results for "multicuts"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
53	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-conquer approximation algorithms via spreading metrics.	J. ACM	2000	DBLP DOI BibTeX RDF	feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement
33	Michael Malmros Sørensen	b-Tree Facets for the Simple Graph Partitioning Polytope.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	clustering, graph partitioning, polyhedral combinatorics, multicuts
33	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm
26	Ojas Parekh, Danny Segev	Path Hitting in Acyclic Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Edge cover, Tree augmentation, Tree multicut, Approximation algorithms, Linear programming, Primal-dual, Edge dominating set
26	Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy	Approximation algorithms for labeling hierarchical taxonomies.	SODA	2008	DBLP BibTeX RDF
26	Mingyu Xiao 0001	Algorithms for Multiterminal Cuts.	CSR	2008	DBLP DOI BibTeX RDF	Multiterminal Cut, Graph Algorithm, Fixed Parameter Tractability, Multicut
25	Evgeny Levinkov, Amirhossein Kardoost, Bjoern Andres, Margret Keuper	Higher-Order Multicuts for Geometric Model Fitting and Motion Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	2023	DBLP DOI BibTeX RDF
25	Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange	A polyhedral study of lifted multicuts.	Discret. Optim.	2023	DBLP DOI BibTeX RDF
25	Amirhossein Kardoost	Minimum cost multicuts for image and motion segmentation.		2023	RDF
25	Kazushi Aiba, Kanji Tanaka 0003, Ryogo Yamamoto	Minimum Cost Multicuts for Incorrect Landmark Edge Detection in Pose-graph SLAM.	CoRR	2022	DBLP DOI BibTeX RDF
25	Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange	A Polyhedral Study of Lifted Multicuts.	CoRR	2022	DBLP BibTeX RDF
25	Steffen Jung 0001, Margret Keuper	Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks.	CoRR	2022	DBLP DOI BibTeX RDF
25	Steffen Jung 0001, Margret Keuper	Learning to Solve Minimum Cost Multicuts Efficiently Using Edge-Weighted Graph Convolutional Neural Networks.	ECML/PKDD (2)	2022	DBLP DOI BibTeX RDF
25	Kazushi Aiba, Kanji Tanaka 0003, Ryogo Yamamoto	Detecting Landmark Misrecognition in Pose-Graph SLAM via Minimum Cost Multicuts.	CIVEMSA	2022	DBLP DOI BibTeX RDF
25	Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif	A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.	APPROX/RANDOM	2022	DBLP DOI BibTeX RDF
25	Amirhossein Kardoost, Margret Keuper	Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation.	CoRR	2021	DBLP BibTeX RDF
25	Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay	A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals.	SIAM J. Comput.	2021	DBLP DOI BibTeX RDF
25	Amirhossein Kardoost, Margret Keuper	Uncertainty in minimum cost multicuts for image and motion segmentation.	UAI	2021	DBLP BibTeX RDF
25	Kalun Ho, Avraam Chatzimichailidis, Margret Keuper, Janis Keuper	MSM: Multi-stage Multicuts for Scalable Image Clustering.	ISC Workshops	2021	DBLP DOI BibTeX RDF
25	Kalun Ho, Janis Keuper, Margret Keuper	Unsupervised Multiple Person Tracking using AutoEncoder-Based Lifted Multicuts.	CoRR	2020	DBLP BibTeX RDF
25	Kazuhiro Kurita, Yasuaki Kobayashi	Efficient Enumerations for Minimal Multicuts and Multiway Cuts.	CoRR	2020	DBLP BibTeX RDF
25	Kazuhiro Kurita, Yasuaki Kobayashi	Efficient Enumerations for Minimal Multicuts and Multiway Cuts.	MFCS	2020	DBLP DOI BibTeX RDF
25	Jan-Hendrik Lange	Multicut optimization guarantees & geometry of lifted multicuts.		2020	RDF
25	Cédric Bentz	An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face.	Algorithmica	2019	DBLP DOI BibTeX RDF
25	Constantin Pape, Alex Matskevych, Julian Hennies, Anna Kreshuk	Leveraging Domain Knowledge to improve EM image segmentation with Lifted Multicuts.	CoRR	2019	DBLP BibTeX RDF
25	Constantin Pape, Alex Matskevych, Adrian Wolny, Julian Hennies, Giulia Mizzon, Marion Louveaux, Jacob Musser, Alexis Maizel, Detlev Arendt, Anna Kreshuk	Leveraging Domain Knowledge to Improve Microscopy Image Segmentation With Lifted Multicuts.	Frontiers Comput. Sci.	2019	DBLP DOI BibTeX RDF
25	Emiliano Lancini	TDIness and Multicuts. (Total dual intégralité et multicoupes).		2019	RDF
25	Pavel Dvorák, Dusan Knop	Parameterized Complexity of Length-bounded Cuts and Multicuts.	Algorithmica	2018	DBLP DOI BibTeX RDF
25	Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay	A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals.	SODA	2018	DBLP DOI BibTeX RDF
25	M. S. Ramanujan 0001, Saket Saurabh 0001	Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts.	ACM Trans. Algorithms	2017	DBLP DOI BibTeX RDF
25	Éric Colin de Verdière	Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals.	Algorithmica	2017	DBLP DOI BibTeX RDF
25	Cédric Bentz	An FPT algorithm for planar multicuts with sources and sinks on the outer face.	CoRR	2017	DBLP BibTeX RDF
25	Margret Keuper	Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation.	CoRR	2017	DBLP BibTeX RDF
25	Margret Keuper	Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation.	ICCV	2017	DBLP DOI BibTeX RDF
25	Andrea Hornáková, Jan-Hendrik Lange, Bjoern Andres	Analysis and Optimization of Graph Decompositions by Lifted Multicuts.	ICML	2017	DBLP BibTeX RDF
25	Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr	Higher-order segmentation via multicuts.	Comput. Vis. Image Underst.	2016	DBLP DOI BibTeX RDF
25	Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay	A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals.	CoRR	2016	DBLP BibTeX RDF
25	Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr	Multicuts and Perturb & MAP for Probabilistic Graph Clustering.	CoRR	2016	DBLP BibTeX RDF
25	Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr	Multicuts and Perturb & MAP for Probabilistic Graph Clustering.	J. Math. Imaging Vis.	2016	DBLP DOI BibTeX RDF
25	Julian Yarkony	Next Generation Multicuts for Semi-Planar Graphs.	CoRR	2015	DBLP BibTeX RDF
25	Éric Colin de Verdière	Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals.	CoRR	2015	DBLP BibTeX RDF
25	Margret Keuper, Evgeny Levinkov, Nicolas Bonneel, Guillaume Lavoué, Thomas Brox, Bjoern Andres	Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts.	CoRR	2015	DBLP BibTeX RDF
25	Bjoern Andres	Lifting of Multicuts.	CoRR	2015	DBLP BibTeX RDF
25	Margret Keuper, Bjoern Andres, Thomas Brox	Motion Trajectory Segmentation via Minimum Cost Multicuts.	ICCV	2015	DBLP DOI BibTeX RDF
25	Margret Keuper, Evgeny Levinkov, Nicolas Bonneel, Guillaume Lavoué, Thomas Brox, Bjoern Andres	Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts.	ICCV	2015	DBLP DOI BibTeX RDF
25	Éric Colin de Verdière	Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals.	ESA	2015	DBLP DOI BibTeX RDF
25	Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr	Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts.	SSVM	2015	DBLP DOI BibTeX RDF
25	M. S. Ramanujan 0001, Saket Saurabh 0001	Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts.	SODA	2014	DBLP DOI BibTeX RDF
25	Markus Speth	Exact solutions for discrete graphical models: multicuts and reduction techniques.		2014	RDF
25	M. S. Ramanujan 0001, Saket Saurabh 0001	Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts	CoRR	2013	DBLP BibTeX RDF
25	Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr	Higher-order Segmentation via Multicuts	CoRR	2013	DBLP BibTeX RDF
25	Cédric Bentz	A polynomial-time algorithm for planar multicuts with few source-sink pairs	CoRR	2012	DBLP BibTeX RDF
25	Cédric Bentz	A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs.	IPEC	2012	DBLP DOI BibTeX RDF
25	Cédric Bentz	On the hardness of finding near-optimal multicuts in directed acyclic graphs.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
25	Arindam Pal 0001	Minimum multicuts and Steiner forests for Okamura-Seymour graphs	CoRR	2011	DBLP BibTeX RDF
25	Jörg H. Kappes, Markus Speth, Björn Andres, Gerhard Reinelt, Christoph Schnörr	Globally Optimal Image Partitioning by Multicuts.	EMMCVPR	2011	DBLP DOI BibTeX RDF
25	Cédric Bentz	New results on planar and directed multicuts.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
25	Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin	Multicuts and integral multiflows in rings.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
25	Cédric Bentz	A simple algorithm for multicuts in planar graphs with outer terminals.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
25	Cédric Bentz	On Planar and Directed Multicuts with few Source-Sink Pairs.	CTW	2009	DBLP BibTeX RDF
25	Frank Neumann 0001, Joachim Reichel	Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms.	PPSN	2008	DBLP DOI BibTeX RDF
25	Asaf Levin, Danny Segev	Partial multicuts in trees.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
25	Joseph Cheriyan, Howard J. Karloff, Yuval Rabani	Approximating Directed Multicuts.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25
25	Yana Kortsarts, Guy Kortsarz, Zeev Nutov	Greedy approximation algorithms for directed multicuts.	Networks	2005	DBLP DOI BibTeX RDF
25	Asaf Levin, Danny Segev	Partial Multicuts in Trees.	WAOA	2005	DBLP DOI BibTeX RDF
25	Yana Kortsarts, Guy Kortsarz, Zeev Nutov	Approximation Algorithm for Directed Multicuts.	WAOA	2004	DBLP DOI BibTeX RDF
25	Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed	Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.	J. Algorithms	2003	DBLP DOI BibTeX RDF
25	Gruia Calinescu, Cristina G. Fernandes	Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width.	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
25	Joseph Cheriyan, Howard J. Karloff, Yuval Rabani	Approximating Directed Multicuts.	FOCS	2001	DBLP DOI BibTeX RDF
25	Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan 0001	Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.	Algorithmica	1998	DBLP DOI BibTeX RDF
25	Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed	Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.	IPCO	1998	DBLP DOI BibTeX RDF
25	Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos	Approximation Algorithms for Steiner and Directed Multicuts.	J. Algorithms	1997	DBLP DOI BibTeX RDF