UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Submodularity on a Tree: Unifying L-(sic)-Convex and Bisubmodular Functions

Kolmogorov, V; (2011) Submodularity on a Tree: Unifying L-(sic)-Convex and Bisubmodular Functions. In: Murlak, F and Sankowski, P, (eds.) (Proceedings) 36th International Symposium on Mathematical Foundations of Computer Science (MFCS) / Young Research Forum. (pp. pp. 400-411). SPRINGER-VERLAG BERLIN

Full text not available from this repository.
Type: Proceedings paper
Title: Submodularity on a Tree: Unifying L-(sic)-Convex and Bisubmodular Functions
Event: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS) / Young Research Forum
Location: Univ Warsaw, Warsaw, POLAND
Dates: 22 August 2011 - 26 August 2011
ISBN-13: 978-3-642-22992-3
Keywords: Science & Technology, Technology, Physical Sciences, Computer Science, Theory & Methods, Mathematics, Applied, Computer Science, Mathematics, Submodularity, L-(sic)-convexity, bisubmodularity, Valued Constraint Satisfaction Problem (VCSP), CONSTRAINT SATISFACTION PROBLEMS, DISCRETE CONVEX-ANALYSIS, OPTIMIZATION PROBLEMS, FUNCTION MINIMIZATION, COMPLEXITY, ALGORITHM, MATROIDS, SYSTEMS
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/170480
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item