The following pages link to Vangelis Th. Paschos (Q218830):
Displaying 50 items.
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- (Q672470) (redirect page) (← links)
- Average case analysis of greedy algorithms for optimisation problems on set systems (Q672472) (← links)
- (Q732319) (redirect page) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- (Q834903) (redirect page) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem (Q1129388) (← links)
- A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem (Q1195856) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- An improved general procedure for lexicographic bottleneck problems (Q1306359) (← links)
- Approximation results for the minimum graph coloring problem (Q1321829) (← links)
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems (Q1356067) (← links)
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts (Q1357776) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA) (Q1386412) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- Polynomial approximation and graph-coloring (Q1404543) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- Master-slave strategy and polynomial approximation (Q1588828) (← links)
- Structurally parameterized \(d\)-Scattered Set (Q1627183) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
