The following pages link to Giulia Galbiati (Q496636):
Displayed 36 items.
- On minimum reload cost cycle cover (Q496639) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints (Q909452) (← links)
- The complexity of a minimum reload cost diameter problem (Q1003738) (← links)
- On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002) (← links)
- Item:Q496636 (redirect page) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- An exact upper bound to the maximum number of perfect matchings in cubic pseudographs (Q1164639) (← links)
- On the complexity of finding multi-constrained spanning trees (Q1171508) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- Random pseudo-polynomial algorithms for some combinatorial programming problems (Q1194734) (← links)
- On the computation of pfaffians (Q1329786) (← links)
- A short note on the approximability of the maximum leaves spanning tree problem (Q1336751) (← links)
- On the approximation of the minimum disturbance \(p\)-facility location problem (Q1348254) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
- Approximability of hard combinatorial optimization problems: an introduction (Q1593534) (← links)
- Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
- On Minimum Reload Cost Cycle Cover (Q2883554) (← links)
- On Minimum Changeover Cost Arborescences (Q3005849) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- Approximating Minimum Cut with Bounded Size (Q3091504) (← links)
- On Optimum Cycle Bases (Q3438962) (← links)
- Approximating Max Cut with Limited Unbalance (Q3439482) (← links)
- (Q3745296) (← links)
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (Q3936521) (← links)
- Random pseudo-polynomial algorithms for exact matroid problems (Q3990608) (← links)
- On Permutation-Embedding Sequences (Q4103535) (← links)
- (Q4217594) (← links)
- (Q4474081) (← links)
- Linking-Centers and Reliable-Trees of a Network (Q4721051) (← links)
- The Bounded Path Tree Problem (Q4750668) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Approximating Maximum Cut with Limited Unbalance (Q5443520) (← links)
- Approximation and Online Algorithms (Q5896929) (← links)