Energy of convex sets, shortest paths, and resistance

DOI10.1006/jcta.2000.3153zbMath0993.05094DBLPjournals/jct/Lovasz01OpenAlexW1978499115WikidataQ100603321 ScholiaQ100603321MaRDI QIDQ5937247

No author found.

Publication date: 25 September 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bac82e857adc7cdc60fde6db7ba8490fe4a2855b

zbMATH Keywords

shortest pathconvex setspolytoperesistance

Mathematics Subject Classification ID

Stochastic programming (90C15) Paths and cycles (05C38)

Related Items (2)

Distributionally robust mixed integer linear programs: persistency models with applications ⋮ Blocking duality for \(p\)-modulus on networks and applications

Cites Work

• Entropy splitting for antiblocking corners and perfect graphs
• Geometric algorithms and combinatorial optimization
• Resistance bounds for first-passage percolation and maximum flow
• Isoperimetric problems for convex bodies and a localization lemma
• Anti-blocking polyhedra
• On the width-length inequality
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Energy of convex sets, shortest paths, and resistance